Theorem prdstgpd 24046

Description: The product of a family of topological groups is a topological group. (Contributed by Mario Carneiro, 22-Sep-2015.)

Hypotheses

Ref	Expression
prdstgpd.y	⊢ 𝑌 = (𝑆Xs𝑅)
prdstgpd.i	⊢ (𝜑 → 𝐼 ∈ 𝑊)
prdstgpd.s	⊢ (𝜑 → 𝑆 ∈ 𝑉)
prdstgpd.r	⊢ (𝜑 → 𝑅:𝐼⟶TopGrp)

Assertion

Ref	Expression
prdstgpd	⊢ (𝜑 → 𝑌 ∈ TopGrp)

Proof of Theorem prdstgpd

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		prdstgpd.y	. . 3 ⊢ 𝑌 = (𝑆Xs𝑅)
2		prdstgpd.i	. . 3 ⊢ (𝜑 → 𝐼 ∈ 𝑊)
3		prdstgpd.s	. . 3 ⊢ (𝜑 → 𝑆 ∈ 𝑉)
4		prdstgpd.r	. . . 4 ⊢ (𝜑 → 𝑅:𝐼⟶TopGrp)
5		tgpgrp 23999	. . . . 5 ⊢ (𝑥 ∈ TopGrp → 𝑥 ∈ Grp)
6	5	ssriv 3947	. . . 4 ⊢ TopGrp ⊆ Grp
7		fss 6686	. . . 4 ⊢ ((𝑅:𝐼⟶TopGrp ∧ TopGrp ⊆ Grp) → 𝑅:𝐼⟶Grp)
8	4, 6, 7	sylancl 586	. . 3 ⊢ (𝜑 → 𝑅:𝐼⟶Grp)
9	1, 2, 3, 8	prdsgrpd 18965	. 2 ⊢ (𝜑 → 𝑌 ∈ Grp)
10		tgptmd 24000	. . . . 5 ⊢ (𝑥 ∈ TopGrp → 𝑥 ∈ TopMnd)
11	10	ssriv 3947	. . . 4 ⊢ TopGrp ⊆ TopMnd
12		fss 6686	. . . 4 ⊢ ((𝑅:𝐼⟶TopGrp ∧ TopGrp ⊆ TopMnd) → 𝑅:𝐼⟶TopMnd)
13	4, 11, 12	sylancl 586	. . 3 ⊢ (𝜑 → 𝑅:𝐼⟶TopMnd)
14	1, 2, 3, 13	prdstmdd 24045	. 2 ⊢ (𝜑 → 𝑌 ∈ TopMnd)
15		eqid 2729	. . . 4 ⊢ (∏t‘(TopOpen ∘ 𝑅)) = (∏t‘(TopOpen ∘ 𝑅))
16		eqid 2729	. . . . . 6 ⊢ (TopOpen‘𝑌) = (TopOpen‘𝑌)
17		eqid 2729	. . . . . 6 ⊢ (Base‘𝑌) = (Base‘𝑌)
18	16, 17	tmdtopon 24002	. . . . 5 ⊢ (𝑌 ∈ TopMnd → (TopOpen‘𝑌) ∈ (TopOn‘(Base‘𝑌)))
19	14, 18	syl 17	. . . 4 ⊢ (𝜑 → (TopOpen‘𝑌) ∈ (TopOn‘(Base‘𝑌)))
20		topnfn 17365	. . . . . 6 ⊢ TopOpen Fn V
21	4	ffnd 6671	. . . . . . 7 ⊢ (𝜑 → 𝑅 Fn 𝐼)
22		dffn2 6672	. . . . . . 7 ⊢ (𝑅 Fn 𝐼 ↔ 𝑅:𝐼⟶V)
23	21, 22	sylib 218	. . . . . 6 ⊢ (𝜑 → 𝑅:𝐼⟶V)
24		fnfco 6707	. . . . . 6 ⊢ ((TopOpen Fn V ∧ 𝑅:𝐼⟶V) → (TopOpen ∘ 𝑅) Fn 𝐼)
25	20, 23, 24	sylancr 587	. . . . 5 ⊢ (𝜑 → (TopOpen ∘ 𝑅) Fn 𝐼)
26		fvco3 6942	. . . . . . . 8 ⊢ ((𝑅:𝐼⟶TopGrp ∧ 𝑦 ∈ 𝐼) → ((TopOpen ∘ 𝑅)‘𝑦) = (TopOpen‘(𝑅‘𝑦)))
27	4, 26	sylan 580	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → ((TopOpen ∘ 𝑅)‘𝑦) = (TopOpen‘(𝑅‘𝑦)))
28	4	ffvelcdmda 7038	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝑅‘𝑦) ∈ TopGrp)
29		eqid 2729	. . . . . . . . 9 ⊢ (TopOpen‘(𝑅‘𝑦)) = (TopOpen‘(𝑅‘𝑦))
30		eqid 2729	. . . . . . . . 9 ⊢ (Base‘(𝑅‘𝑦)) = (Base‘(𝑅‘𝑦))
31	29, 30	tgptopon 24003	. . . . . . . 8 ⊢ ((𝑅‘𝑦) ∈ TopGrp → (TopOpen‘(𝑅‘𝑦)) ∈ (TopOn‘(Base‘(𝑅‘𝑦))))
32		topontop 22834	. . . . . . . 8 ⊢ ((TopOpen‘(𝑅‘𝑦)) ∈ (TopOn‘(Base‘(𝑅‘𝑦))) → (TopOpen‘(𝑅‘𝑦)) ∈ Top)
33	28, 31, 32	3syl 18	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (TopOpen‘(𝑅‘𝑦)) ∈ Top)
34	27, 33	eqeltrd 2828	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → ((TopOpen ∘ 𝑅)‘𝑦) ∈ Top)
35	34	ralrimiva 3125	. . . . 5 ⊢ (𝜑 → ∀𝑦 ∈ 𝐼 ((TopOpen ∘ 𝑅)‘𝑦) ∈ Top)
36		ffnfv 7073	. . . . 5 ⊢ ((TopOpen ∘ 𝑅):𝐼⟶Top ↔ ((TopOpen ∘ 𝑅) Fn 𝐼 ∧ ∀𝑦 ∈ 𝐼 ((TopOpen ∘ 𝑅)‘𝑦) ∈ Top))
37	25, 35, 36	sylanbrc 583	. . . 4 ⊢ (𝜑 → (TopOpen ∘ 𝑅):𝐼⟶Top)
38	19	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (TopOpen‘𝑌) ∈ (TopOn‘(Base‘𝑌)))
39	1, 3, 2, 21, 16	prdstopn 23549	. . . . . . . . . . . 12 ⊢ (𝜑 → (TopOpen‘𝑌) = (∏t‘(TopOpen ∘ 𝑅)))
40	39	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (TopOpen‘𝑌) = (∏t‘(TopOpen ∘ 𝑅)))
41	40	eqcomd 2735	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (∏t‘(TopOpen ∘ 𝑅)) = (TopOpen‘𝑌))
42	41, 38	eqeltrd 2828	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (∏t‘(TopOpen ∘ 𝑅)) ∈ (TopOn‘(Base‘𝑌)))
43		toponuni 22835	. . . . . . . . 9 ⊢ ((∏t‘(TopOpen ∘ 𝑅)) ∈ (TopOn‘(Base‘𝑌)) → (Base‘𝑌) = ∪ (∏t‘(TopOpen ∘ 𝑅)))
44		mpteq1 5191	. . . . . . . . 9 ⊢ ((Base‘𝑌) = ∪ (∏t‘(TopOpen ∘ 𝑅)) → (𝑥 ∈ (Base‘𝑌) ↦ (𝑥‘𝑦)) = (𝑥 ∈ ∪ (∏t‘(TopOpen ∘ 𝑅)) ↦ (𝑥‘𝑦)))
45	42, 43, 44	3syl 18	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝑥 ∈ (Base‘𝑌) ↦ (𝑥‘𝑦)) = (𝑥 ∈ ∪ (∏t‘(TopOpen ∘ 𝑅)) ↦ (𝑥‘𝑦)))
46	2	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → 𝐼 ∈ 𝑊)
47	37	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (TopOpen ∘ 𝑅):𝐼⟶Top)
48		simpr 484	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → 𝑦 ∈ 𝐼)
49		eqid 2729	. . . . . . . . . 10 ⊢ ∪ (∏t‘(TopOpen ∘ 𝑅)) = ∪ (∏t‘(TopOpen ∘ 𝑅))
50	49, 15	ptpjcn 23532	. . . . . . . . 9 ⊢ ((𝐼 ∈ 𝑊 ∧ (TopOpen ∘ 𝑅):𝐼⟶Top ∧ 𝑦 ∈ 𝐼) → (𝑥 ∈ ∪ (∏t‘(TopOpen ∘ 𝑅)) ↦ (𝑥‘𝑦)) ∈ ((∏t‘(TopOpen ∘ 𝑅)) Cn ((TopOpen ∘ 𝑅)‘𝑦)))
51	46, 47, 48, 50	syl3anc 1373	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝑥 ∈ ∪ (∏t‘(TopOpen ∘ 𝑅)) ↦ (𝑥‘𝑦)) ∈ ((∏t‘(TopOpen ∘ 𝑅)) Cn ((TopOpen ∘ 𝑅)‘𝑦)))
52	45, 51	eqeltrd 2828	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝑥 ∈ (Base‘𝑌) ↦ (𝑥‘𝑦)) ∈ ((∏t‘(TopOpen ∘ 𝑅)) Cn ((TopOpen ∘ 𝑅)‘𝑦)))
53	41, 27	oveq12d 7387	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → ((∏t‘(TopOpen ∘ 𝑅)) Cn ((TopOpen ∘ 𝑅)‘𝑦)) = ((TopOpen‘𝑌) Cn (TopOpen‘(𝑅‘𝑦))))
54	52, 53	eleqtrd 2830	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝑥 ∈ (Base‘𝑌) ↦ (𝑥‘𝑦)) ∈ ((TopOpen‘𝑌) Cn (TopOpen‘(𝑅‘𝑦))))
55		eqid 2729	. . . . . . . 8 ⊢ (invg‘(𝑅‘𝑦)) = (invg‘(𝑅‘𝑦))
56	29, 55	tgpinv 24006	. . . . . . 7 ⊢ ((𝑅‘𝑦) ∈ TopGrp → (invg‘(𝑅‘𝑦)) ∈ ((TopOpen‘(𝑅‘𝑦)) Cn (TopOpen‘(𝑅‘𝑦))))
57	28, 56	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (invg‘(𝑅‘𝑦)) ∈ ((TopOpen‘(𝑅‘𝑦)) Cn (TopOpen‘(𝑅‘𝑦))))
58	38, 54, 57	cnmpt11f 23585	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝑥 ∈ (Base‘𝑌) ↦ ((invg‘(𝑅‘𝑦))‘(𝑥‘𝑦))) ∈ ((TopOpen‘𝑌) Cn (TopOpen‘(𝑅‘𝑦))))
59	27	oveq2d 7385	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → ((TopOpen‘𝑌) Cn ((TopOpen ∘ 𝑅)‘𝑦)) = ((TopOpen‘𝑌) Cn (TopOpen‘(𝑅‘𝑦))))
60	58, 59	eleqtrrd 2831	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝑥 ∈ (Base‘𝑌) ↦ ((invg‘(𝑅‘𝑦))‘(𝑥‘𝑦))) ∈ ((TopOpen‘𝑌) Cn ((TopOpen ∘ 𝑅)‘𝑦)))
61	15, 19, 2, 37, 60	ptcn 23548	. . 3 ⊢ (𝜑 → (𝑥 ∈ (Base‘𝑌) ↦ (𝑦 ∈ 𝐼 ↦ ((invg‘(𝑅‘𝑦))‘(𝑥‘𝑦)))) ∈ ((TopOpen‘𝑌) Cn (∏t‘(TopOpen ∘ 𝑅))))
62		eqid 2729	. . . . . . 7 ⊢ (invg‘𝑌) = (invg‘𝑌)
63	17, 62	grpinvf 18901	. . . . . 6 ⊢ (𝑌 ∈ Grp → (invg‘𝑌):(Base‘𝑌)⟶(Base‘𝑌))
64	9, 63	syl 17	. . . . 5 ⊢ (𝜑 → (invg‘𝑌):(Base‘𝑌)⟶(Base‘𝑌))
65	64	feqmptd 6911	. . . 4 ⊢ (𝜑 → (invg‘𝑌) = (𝑥 ∈ (Base‘𝑌) ↦ ((invg‘𝑌)‘𝑥)))
66	2	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (Base‘𝑌)) → 𝐼 ∈ 𝑊)
67	3	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (Base‘𝑌)) → 𝑆 ∈ 𝑉)
68	8	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (Base‘𝑌)) → 𝑅:𝐼⟶Grp)
69		simpr 484	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (Base‘𝑌)) → 𝑥 ∈ (Base‘𝑌))
70	1, 66, 67, 68, 17, 62, 69	prdsinvgd 18966	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (Base‘𝑌)) → ((invg‘𝑌)‘𝑥) = (𝑦 ∈ 𝐼 ↦ ((invg‘(𝑅‘𝑦))‘(𝑥‘𝑦))))
71	70	mpteq2dva 5195	. . . 4 ⊢ (𝜑 → (𝑥 ∈ (Base‘𝑌) ↦ ((invg‘𝑌)‘𝑥)) = (𝑥 ∈ (Base‘𝑌) ↦ (𝑦 ∈ 𝐼 ↦ ((invg‘(𝑅‘𝑦))‘(𝑥‘𝑦)))))
72	65, 71	eqtrd 2764	. . 3 ⊢ (𝜑 → (invg‘𝑌) = (𝑥 ∈ (Base‘𝑌) ↦ (𝑦 ∈ 𝐼 ↦ ((invg‘(𝑅‘𝑦))‘(𝑥‘𝑦)))))
73	39	oveq2d 7385	. . 3 ⊢ (𝜑 → ((TopOpen‘𝑌) Cn (TopOpen‘𝑌)) = ((TopOpen‘𝑌) Cn (∏t‘(TopOpen ∘ 𝑅))))
74	61, 72, 73	3eltr4d 2843	. 2 ⊢ (𝜑 → (invg‘𝑌) ∈ ((TopOpen‘𝑌) Cn (TopOpen‘𝑌)))
75	16, 62	istgp 23998	. 2 ⊢ (𝑌 ∈ TopGrp ↔ (𝑌 ∈ Grp ∧ 𝑌 ∈ TopMnd ∧ (invg‘𝑌) ∈ ((TopOpen‘𝑌) Cn (TopOpen‘𝑌))))
76	9, 14, 74, 75	syl3anbrc 1344	1 ⊢ (𝜑 → 𝑌 ∈ TopGrp)

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1540   ∈ wcel 2109  ∀wral 3044  Vcvv 3444   ⊆ wss 3911  ∪ cuni 4867   ↦ cmpt 5183   ∘ ccom 5635   Fn wfn 6494  ⟶wf 6495  ‘cfv 6499  (class class class)co 7369  Basecbs 17156  TopOpenctopn 17361  ∏_tcpt 17378  X_scprds 17385  Grpcgrp 18848  inv_gcminusg 18849  Topctop 22814  TopOnctopon 22831   Cn ccn 23145  TopMndctmd 23991  TopGrpctgp 23992

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5229  ax-sep 5246  ax-nul 5256  ax-pow 5315  ax-pr 5382  ax-un 7691  ax-cnex 11102  ax-resscn 11103  ax-1cn 11104  ax-icn 11105  ax-addcl 11106  ax-addrcl 11107  ax-mulcl 11108  ax-mulrcl 11109  ax-mulcom 11110  ax-addass 11111  ax-mulass 11112  ax-distr 11113  ax-i2m1 11114  ax-1ne0 11115  ax-1rid 11116  ax-rnegex 11117  ax-rrecex 11118  ax-cnre 11119  ax-pre-lttri 11120  ax-pre-lttrn 11121  ax-pre-ltadd 11122  ax-pre-mulgt0 11123

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-rmo 3351  df-reu 3352  df-rab 3403  df-v 3446  df-sbc 3751  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-pss 3931  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-tp 4590  df-op 4592  df-uni 4868  df-int 4907  df-iun 4953  df-iin 4954  df-br 5103  df-opab 5165  df-mpt 5184  df-tr 5210  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6262  df-ord 6323  df-on 6324  df-lim 6325  df-suc 6326  df-iota 6452  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-riota 7326  df-ov 7372  df-oprab 7373  df-mpo 7374  df-om 7823  df-1st 7947  df-2nd 7948  df-frecs 8237  df-wrecs 8268  df-recs 8317  df-rdg 8355  df-1o 8411  df-2o 8412  df-er 8648  df-map 8778  df-ixp 8848  df-en 8896  df-dom 8897  df-sdom 8898  df-fin 8899  df-fi 9338  df-sup 9369  df-pnf 11188  df-mnf 11189  df-xr 11190  df-ltxr 11191  df-le 11192  df-sub 11385  df-neg 11386  df-nn 12165  df-2 12227  df-3 12228  df-4 12229  df-5 12230  df-6 12231  df-7 12232  df-8 12233  df-9 12234  df-n0 12421  df-z 12508  df-dec 12628  df-uz 12772  df-fz 13447  df-struct 17094  df-slot 17129  df-ndx 17141  df-base 17157  df-plusg 17210  df-mulr 17211  df-sca 17213  df-vsca 17214  df-ip 17215  df-tset 17216  df-ple 17217  df-ds 17219  df-hom 17221  df-cco 17222  df-rest 17362  df-topn 17363  df-0g 17381  df-topgen 17383  df-pt 17384  df-prds 17387  df-plusf 18549  df-mgm 18550  df-sgrp 18629  df-mnd 18645  df-grp 18851  df-minusg 18852  df-top 22815  df-topon 22832  df-topsp 22854  df-bases 22867  df-cn 23148  df-cnp 23149  df-tx 23483  df-tmd 23993  df-tgp 23994

This theorem is referenced by: (None)