Theorem tsmsval2 21933

Description: Definition of the topological group sum(s) of a collection 𝐹(𝑥) of values in the group with index set 𝐴. (Contributed by Mario Carneiro, 2-Sep-2015.)

Hypotheses

Ref	Expression
tsmsval.b	⊢ 𝐵 = (Base‘𝐺)
tsmsval.j	⊢ 𝐽 = (TopOpen‘𝐺)
tsmsval.s	⊢ 𝑆 = (𝒫 𝐴 ∩ Fin)
tsmsval.l	⊢ 𝐿 = ran (𝑧 ∈ 𝑆 ↦ {𝑦 ∈ 𝑆 ∣ 𝑧 ⊆ 𝑦})
tsmsval.g	⊢ (𝜑 → 𝐺 ∈ 𝑉)
tsmsval2.f	⊢ (𝜑 → 𝐹 ∈ 𝑊)
tsmsval2.a	⊢ (𝜑 → dom 𝐹 = 𝐴)

Assertion

Ref	Expression
tsmsval2	⊢ (𝜑 → (𝐺 tsums 𝐹) = ((𝐽 fLimf (𝑆filGen𝐿))‘(𝑦 ∈ 𝑆 ↦ (𝐺 Σg (𝐹 ↾ 𝑦)))))

Distinct variable groups:   𝑦,𝑧,𝐹   𝑦,𝐺,𝑧   𝜑,𝑦,𝑧   𝑦,𝑆

Allowed substitution hints:   𝐴(𝑦,𝑧)   𝐵(𝑦,𝑧)   𝑆(𝑧)   𝐽(𝑦,𝑧)   𝐿(𝑦,𝑧)   𝑉(𝑦,𝑧)   𝑊(𝑦,𝑧)

Proof of Theorem tsmsval2

Dummy variables 𝑓 𝑠 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-tsms 21930	. . 3 ⊢ tsums = (𝑤 ∈ V, 𝑓 ∈ V ↦ ⦋(𝒫 dom 𝑓 ∩ Fin) / 𝑠⦌(((TopOpen‘𝑤) fLimf (𝑠filGenran (𝑧 ∈ 𝑠 ↦ {𝑦 ∈ 𝑠 ∣ 𝑧 ⊆ 𝑦})))‘(𝑦 ∈ 𝑠 ↦ (𝑤 Σg (𝑓 ↾ 𝑦)))))
2	1	a1i 11	. 2 ⊢ (𝜑 → tsums = (𝑤 ∈ V, 𝑓 ∈ V ↦ ⦋(𝒫 dom 𝑓 ∩ Fin) / 𝑠⦌(((TopOpen‘𝑤) fLimf (𝑠filGenran (𝑧 ∈ 𝑠 ↦ {𝑦 ∈ 𝑠 ∣ 𝑧 ⊆ 𝑦})))‘(𝑦 ∈ 𝑠 ↦ (𝑤 Σg (𝑓 ↾ 𝑦))))))
3		vex 3203	. . . . . . 7 ⊢ 𝑓 ∈ V
4	3	dmex 7099	. . . . . 6 ⊢ dom 𝑓 ∈ V
5	4	pwex 4848	. . . . 5 ⊢ 𝒫 dom 𝑓 ∈ V
6	5	inex1 4799	. . . 4 ⊢ (𝒫 dom 𝑓 ∩ Fin) ∈ V
7	6	a1i 11	. . 3 ⊢ ((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑓 = 𝐹)) → (𝒫 dom 𝑓 ∩ Fin) ∈ V)
8		simplrl 800	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑓 = 𝐹)) ∧ 𝑠 = (𝒫 dom 𝑓 ∩ Fin)) → 𝑤 = 𝐺)
9	8	fveq2d 6195	. . . . . 6 ⊢ (((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑓 = 𝐹)) ∧ 𝑠 = (𝒫 dom 𝑓 ∩ Fin)) → (TopOpen‘𝑤) = (TopOpen‘𝐺))
10		tsmsval.j	. . . . . 6 ⊢ 𝐽 = (TopOpen‘𝐺)
11	9, 10	syl6eqr 2674	. . . . 5 ⊢ (((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑓 = 𝐹)) ∧ 𝑠 = (𝒫 dom 𝑓 ∩ Fin)) → (TopOpen‘𝑤) = 𝐽)
12		id 22	. . . . . . 7 ⊢ (𝑠 = (𝒫 dom 𝑓 ∩ Fin) → 𝑠 = (𝒫 dom 𝑓 ∩ Fin))
13		simprr 796	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑓 = 𝐹)) → 𝑓 = 𝐹)
14	13	dmeqd 5326	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑓 = 𝐹)) → dom 𝑓 = dom 𝐹)
15		tsmsval2.a	. . . . . . . . . . . 12 ⊢ (𝜑 → dom 𝐹 = 𝐴)
16	15	adantr 481	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑓 = 𝐹)) → dom 𝐹 = 𝐴)
17	14, 16	eqtrd 2656	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑓 = 𝐹)) → dom 𝑓 = 𝐴)
18	17	pweqd 4163	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑓 = 𝐹)) → 𝒫 dom 𝑓 = 𝒫 𝐴)
19	18	ineq1d 3813	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑓 = 𝐹)) → (𝒫 dom 𝑓 ∩ Fin) = (𝒫 𝐴 ∩ Fin))
20		tsmsval.s	. . . . . . . 8 ⊢ 𝑆 = (𝒫 𝐴 ∩ Fin)
21	19, 20	syl6eqr 2674	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑓 = 𝐹)) → (𝒫 dom 𝑓 ∩ Fin) = 𝑆)
22	12, 21	sylan9eqr 2678	. . . . . 6 ⊢ (((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑓 = 𝐹)) ∧ 𝑠 = (𝒫 dom 𝑓 ∩ Fin)) → 𝑠 = 𝑆)
23		rabeq 3192	. . . . . . . . . 10 ⊢ (𝑠 = 𝑆 → {𝑦 ∈ 𝑠 ∣ 𝑧 ⊆ 𝑦} = {𝑦 ∈ 𝑆 ∣ 𝑧 ⊆ 𝑦})
24	22, 23	syl 17	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑓 = 𝐹)) ∧ 𝑠 = (𝒫 dom 𝑓 ∩ Fin)) → {𝑦 ∈ 𝑠 ∣ 𝑧 ⊆ 𝑦} = {𝑦 ∈ 𝑆 ∣ 𝑧 ⊆ 𝑦})
25	22, 24	mpteq12dv 4733	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑓 = 𝐹)) ∧ 𝑠 = (𝒫 dom 𝑓 ∩ Fin)) → (𝑧 ∈ 𝑠 ↦ {𝑦 ∈ 𝑠 ∣ 𝑧 ⊆ 𝑦}) = (𝑧 ∈ 𝑆 ↦ {𝑦 ∈ 𝑆 ∣ 𝑧 ⊆ 𝑦}))
26	25	rneqd 5353	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑓 = 𝐹)) ∧ 𝑠 = (𝒫 dom 𝑓 ∩ Fin)) → ran (𝑧 ∈ 𝑠 ↦ {𝑦 ∈ 𝑠 ∣ 𝑧 ⊆ 𝑦}) = ran (𝑧 ∈ 𝑆 ↦ {𝑦 ∈ 𝑆 ∣ 𝑧 ⊆ 𝑦}))
27		tsmsval.l	. . . . . . 7 ⊢ 𝐿 = ran (𝑧 ∈ 𝑆 ↦ {𝑦 ∈ 𝑆 ∣ 𝑧 ⊆ 𝑦})
28	26, 27	syl6eqr 2674	. . . . . 6 ⊢ (((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑓 = 𝐹)) ∧ 𝑠 = (𝒫 dom 𝑓 ∩ Fin)) → ran (𝑧 ∈ 𝑠 ↦ {𝑦 ∈ 𝑠 ∣ 𝑧 ⊆ 𝑦}) = 𝐿)
29	22, 28	oveq12d 6668	. . . . 5 ⊢ (((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑓 = 𝐹)) ∧ 𝑠 = (𝒫 dom 𝑓 ∩ Fin)) → (𝑠filGenran (𝑧 ∈ 𝑠 ↦ {𝑦 ∈ 𝑠 ∣ 𝑧 ⊆ 𝑦})) = (𝑆filGen𝐿))
30	11, 29	oveq12d 6668	. . . 4 ⊢ (((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑓 = 𝐹)) ∧ 𝑠 = (𝒫 dom 𝑓 ∩ Fin)) → ((TopOpen‘𝑤) fLimf (𝑠filGenran (𝑧 ∈ 𝑠 ↦ {𝑦 ∈ 𝑠 ∣ 𝑧 ⊆ 𝑦}))) = (𝐽 fLimf (𝑆filGen𝐿)))
31		simplrr 801	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑓 = 𝐹)) ∧ 𝑠 = (𝒫 dom 𝑓 ∩ Fin)) → 𝑓 = 𝐹)
32	31	reseq1d 5395	. . . . . 6 ⊢ (((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑓 = 𝐹)) ∧ 𝑠 = (𝒫 dom 𝑓 ∩ Fin)) → (𝑓 ↾ 𝑦) = (𝐹 ↾ 𝑦))
33	8, 32	oveq12d 6668	. . . . 5 ⊢ (((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑓 = 𝐹)) ∧ 𝑠 = (𝒫 dom 𝑓 ∩ Fin)) → (𝑤 Σg (𝑓 ↾ 𝑦)) = (𝐺 Σg (𝐹 ↾ 𝑦)))
34	22, 33	mpteq12dv 4733	. . . 4 ⊢ (((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑓 = 𝐹)) ∧ 𝑠 = (𝒫 dom 𝑓 ∩ Fin)) → (𝑦 ∈ 𝑠 ↦ (𝑤 Σg (𝑓 ↾ 𝑦))) = (𝑦 ∈ 𝑆 ↦ (𝐺 Σg (𝐹 ↾ 𝑦))))
35	30, 34	fveq12d 6197	. . 3 ⊢ (((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑓 = 𝐹)) ∧ 𝑠 = (𝒫 dom 𝑓 ∩ Fin)) → (((TopOpen‘𝑤) fLimf (𝑠filGenran (𝑧 ∈ 𝑠 ↦ {𝑦 ∈ 𝑠 ∣ 𝑧 ⊆ 𝑦})))‘(𝑦 ∈ 𝑠 ↦ (𝑤 Σg (𝑓 ↾ 𝑦)))) = ((𝐽 fLimf (𝑆filGen𝐿))‘(𝑦 ∈ 𝑆 ↦ (𝐺 Σg (𝐹 ↾ 𝑦)))))
36	7, 35	csbied 3560	. 2 ⊢ ((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑓 = 𝐹)) → ⦋(𝒫 dom 𝑓 ∩ Fin) / 𝑠⦌(((TopOpen‘𝑤) fLimf (𝑠filGenran (𝑧 ∈ 𝑠 ↦ {𝑦 ∈ 𝑠 ∣ 𝑧 ⊆ 𝑦})))‘(𝑦 ∈ 𝑠 ↦ (𝑤 Σg (𝑓 ↾ 𝑦)))) = ((𝐽 fLimf (𝑆filGen𝐿))‘(𝑦 ∈ 𝑆 ↦ (𝐺 Σg (𝐹 ↾ 𝑦)))))
37		tsmsval.g	. . 3 ⊢ (𝜑 → 𝐺 ∈ 𝑉)
38		elex 3212	. . 3 ⊢ (𝐺 ∈ 𝑉 → 𝐺 ∈ V)
39	37, 38	syl 17	. 2 ⊢ (𝜑 → 𝐺 ∈ V)
40		tsmsval2.f	. . 3 ⊢ (𝜑 → 𝐹 ∈ 𝑊)
41		elex 3212	. . 3 ⊢ (𝐹 ∈ 𝑊 → 𝐹 ∈ V)
42	40, 41	syl 17	. 2 ⊢ (𝜑 → 𝐹 ∈ V)
43		fvexd 6203	. 2 ⊢ (𝜑 → ((𝐽 fLimf (𝑆filGen𝐿))‘(𝑦 ∈ 𝑆 ↦ (𝐺 Σg (𝐹 ↾ 𝑦)))) ∈ V)
44	2, 36, 39, 42, 43	ovmpt2d 6788	1 ⊢ (𝜑 → (𝐺 tsums 𝐹) = ((𝐽 fLimf (𝑆filGen𝐿))‘(𝑦 ∈ 𝑆 ↦ (𝐺 Σg (𝐹 ↾ 𝑦)))))

Syntax hints:   → wi 4   ∧ wa 384   = wceq 1483   ∈ wcel 1990  {crab 2916  Vcvv 3200  ⦋csb 3533   ∩ cin 3573   ⊆ wss 3574  𝒫 cpw 4158   ↦ cmpt 4729  dom cdm 5114  ran crn 5115   ↾ cres 5116  ‘cfv 5888  (class class class)co 6650   ↦ cmpt2 6652  Fincfn 7955  Basecbs 15857  TopOpenctopn 16082   Σ_g cgsu 16101  filGencfg 19735   fLimf cflf 21739   tsums ctsu 21929

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-iota 5851  df-fun 5890  df-fv 5896  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-tsms 21930

This theorem is referenced by:  tsmsval  21934  tsmspropd  21935