Theorem prdstgpd 23476

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 23429	. . . . 5 ⊢ (𝑥 ∈ TopGrp → 𝑥 ∈ Grp)
6	5	ssriv 3948	. . . 4 ⊢ TopGrp ⊆ Grp
7		fss 6685	. . . 4 ⊢ ((𝑅:𝐼⟶TopGrp ∧ TopGrp ⊆ Grp) → 𝑅:𝐼⟶Grp)
8	4, 6, 7	sylancl 586	. . 3 ⊢ (𝜑 → 𝑅:𝐼⟶Grp)
9	1, 2, 3, 8	prdsgrpd 18857	. 2 ⊢ (𝜑 → 𝑌 ∈ Grp)
10		tgptmd 23430	. . . . 5 ⊢ (𝑥 ∈ TopGrp → 𝑥 ∈ TopMnd)
11	10	ssriv 3948	. . . 4 ⊢ TopGrp ⊆ TopMnd
12		fss 6685	. . . 4 ⊢ ((𝑅:𝐼⟶TopGrp ∧ TopGrp ⊆ TopMnd) → 𝑅:𝐼⟶TopMnd)
13	4, 11, 12	sylancl 586	. . 3 ⊢ (𝜑 → 𝑅:𝐼⟶TopMnd)
14	1, 2, 3, 13	prdstmdd 23475	. 2 ⊢ (𝜑 → 𝑌 ∈ TopMnd)
15		eqid 2736	. . . 4 ⊢ (∏t‘(TopOpen ∘ 𝑅)) = (∏t‘(TopOpen ∘ 𝑅))
16		eqid 2736	. . . . . 6 ⊢ (TopOpen‘𝑌) = (TopOpen‘𝑌)
17		eqid 2736	. . . . . 6 ⊢ (Base‘𝑌) = (Base‘𝑌)
18	16, 17	tmdtopon 23432	. . . . 5 ⊢ (𝑌 ∈ TopMnd → (TopOpen‘𝑌) ∈ (TopOn‘(Base‘𝑌)))
19	14, 18	syl 17	. . . 4 ⊢ (𝜑 → (TopOpen‘𝑌) ∈ (TopOn‘(Base‘𝑌)))
20		topnfn 17307	. . . . . 6 ⊢ TopOpen Fn V
21	4	ffnd 6669	. . . . . . 7 ⊢ (𝜑 → 𝑅 Fn 𝐼)
22		dffn2 6670	. . . . . . 7 ⊢ (𝑅 Fn 𝐼 ↔ 𝑅:𝐼⟶V)
23	21, 22	sylib 217	. . . . . 6 ⊢ (𝜑 → 𝑅:𝐼⟶V)
24		fnfco 6707	. . . . . 6 ⊢ ((TopOpen Fn V ∧ 𝑅:𝐼⟶V) → (TopOpen ∘ 𝑅) Fn 𝐼)
25	20, 23, 24	sylancr 587	. . . . 5 ⊢ (𝜑 → (TopOpen ∘ 𝑅) Fn 𝐼)
26		fvco3 6940	. . . . . . . 8 ⊢ ((𝑅:𝐼⟶TopGrp ∧ 𝑦 ∈ 𝐼) → ((TopOpen ∘ 𝑅)‘𝑦) = (TopOpen‘(𝑅‘𝑦)))
27	4, 26	sylan 580	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → ((TopOpen ∘ 𝑅)‘𝑦) = (TopOpen‘(𝑅‘𝑦)))
28	4	ffvelcdmda 7035	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝑅‘𝑦) ∈ TopGrp)
29		eqid 2736	. . . . . . . . 9 ⊢ (TopOpen‘(𝑅‘𝑦)) = (TopOpen‘(𝑅‘𝑦))
30		eqid 2736	. . . . . . . . 9 ⊢ (Base‘(𝑅‘𝑦)) = (Base‘(𝑅‘𝑦))
31	29, 30	tgptopon 23433	. . . . . . . 8 ⊢ ((𝑅‘𝑦) ∈ TopGrp → (TopOpen‘(𝑅‘𝑦)) ∈ (TopOn‘(Base‘(𝑅‘𝑦))))
32		topontop 22262	. . . . . . . 8 ⊢ ((TopOpen‘(𝑅‘𝑦)) ∈ (TopOn‘(Base‘(𝑅‘𝑦))) → (TopOpen‘(𝑅‘𝑦)) ∈ Top)
33	28, 31, 32	3syl 18	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (TopOpen‘(𝑅‘𝑦)) ∈ Top)
34	27, 33	eqeltrd 2838	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → ((TopOpen ∘ 𝑅)‘𝑦) ∈ Top)
35	34	ralrimiva 3143	. . . . 5 ⊢ (𝜑 → ∀𝑦 ∈ 𝐼 ((TopOpen ∘ 𝑅)‘𝑦) ∈ Top)
36		ffnfv 7066	. . . . 5 ⊢ ((TopOpen ∘ 𝑅):𝐼⟶Top ↔ ((TopOpen ∘ 𝑅) Fn 𝐼 ∧ ∀𝑦 ∈ 𝐼 ((TopOpen ∘ 𝑅)‘𝑦) ∈ Top))
37	25, 35, 36	sylanbrc 583	. . . 4 ⊢ (𝜑 → (TopOpen ∘ 𝑅):𝐼⟶Top)
38	19	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (TopOpen‘𝑌) ∈ (TopOn‘(Base‘𝑌)))
39	1, 3, 2, 21, 16	prdstopn 22979	. . . . . . . . . . . 12 ⊢ (𝜑 → (TopOpen‘𝑌) = (∏t‘(TopOpen ∘ 𝑅)))
40	39	adantr 481	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (TopOpen‘𝑌) = (∏t‘(TopOpen ∘ 𝑅)))
41	40	eqcomd 2742	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (∏t‘(TopOpen ∘ 𝑅)) = (TopOpen‘𝑌))
42	41, 38	eqeltrd 2838	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (∏t‘(TopOpen ∘ 𝑅)) ∈ (TopOn‘(Base‘𝑌)))
43		toponuni 22263	. . . . . . . . 9 ⊢ ((∏t‘(TopOpen ∘ 𝑅)) ∈ (TopOn‘(Base‘𝑌)) → (Base‘𝑌) = ∪ (∏t‘(TopOpen ∘ 𝑅)))
44		mpteq1 5198	. . . . . . . . 9 ⊢ ((Base‘𝑌) = ∪ (∏t‘(TopOpen ∘ 𝑅)) → (𝑥 ∈ (Base‘𝑌) ↦ (𝑥‘𝑦)) = (𝑥 ∈ ∪ (∏t‘(TopOpen ∘ 𝑅)) ↦ (𝑥‘𝑦)))
45	42, 43, 44	3syl 18	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝑥 ∈ (Base‘𝑌) ↦ (𝑥‘𝑦)) = (𝑥 ∈ ∪ (∏t‘(TopOpen ∘ 𝑅)) ↦ (𝑥‘𝑦)))
46	2	adantr 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → 𝐼 ∈ 𝑊)
47	37	adantr 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (TopOpen ∘ 𝑅):𝐼⟶Top)
48		simpr 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → 𝑦 ∈ 𝐼)
49		eqid 2736	. . . . . . . . . 10 ⊢ ∪ (∏t‘(TopOpen ∘ 𝑅)) = ∪ (∏t‘(TopOpen ∘ 𝑅))
50	49, 15	ptpjcn 22962	. . . . . . . . 9 ⊢ ((𝐼 ∈ 𝑊 ∧ (TopOpen ∘ 𝑅):𝐼⟶Top ∧ 𝑦 ∈ 𝐼) → (𝑥 ∈ ∪ (∏t‘(TopOpen ∘ 𝑅)) ↦ (𝑥‘𝑦)) ∈ ((∏t‘(TopOpen ∘ 𝑅)) Cn ((TopOpen ∘ 𝑅)‘𝑦)))
51	46, 47, 48, 50	syl3anc 1371	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝑥 ∈ ∪ (∏t‘(TopOpen ∘ 𝑅)) ↦ (𝑥‘𝑦)) ∈ ((∏t‘(TopOpen ∘ 𝑅)) Cn ((TopOpen ∘ 𝑅)‘𝑦)))
52	45, 51	eqeltrd 2838	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝑥 ∈ (Base‘𝑌) ↦ (𝑥‘𝑦)) ∈ ((∏t‘(TopOpen ∘ 𝑅)) Cn ((TopOpen ∘ 𝑅)‘𝑦)))
53	41, 27	oveq12d 7375	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → ((∏t‘(TopOpen ∘ 𝑅)) Cn ((TopOpen ∘ 𝑅)‘𝑦)) = ((TopOpen‘𝑌) Cn (TopOpen‘(𝑅‘𝑦))))
54	52, 53	eleqtrd 2840	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝑥 ∈ (Base‘𝑌) ↦ (𝑥‘𝑦)) ∈ ((TopOpen‘𝑌) Cn (TopOpen‘(𝑅‘𝑦))))
55		eqid 2736	. . . . . . . 8 ⊢ (invg‘(𝑅‘𝑦)) = (invg‘(𝑅‘𝑦))
56	29, 55	tgpinv 23436	. . . . . . 7 ⊢ ((𝑅‘𝑦) ∈ TopGrp → (invg‘(𝑅‘𝑦)) ∈ ((TopOpen‘(𝑅‘𝑦)) Cn (TopOpen‘(𝑅‘𝑦))))
57	28, 56	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (invg‘(𝑅‘𝑦)) ∈ ((TopOpen‘(𝑅‘𝑦)) Cn (TopOpen‘(𝑅‘𝑦))))
58	38, 54, 57	cnmpt11f 23015	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝑥 ∈ (Base‘𝑌) ↦ ((invg‘(𝑅‘𝑦))‘(𝑥‘𝑦))) ∈ ((TopOpen‘𝑌) Cn (TopOpen‘(𝑅‘𝑦))))
59	27	oveq2d 7373	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → ((TopOpen‘𝑌) Cn ((TopOpen ∘ 𝑅)‘𝑦)) = ((TopOpen‘𝑌) Cn (TopOpen‘(𝑅‘𝑦))))
60	58, 59	eleqtrrd 2841	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝑥 ∈ (Base‘𝑌) ↦ ((invg‘(𝑅‘𝑦))‘(𝑥‘𝑦))) ∈ ((TopOpen‘𝑌) Cn ((TopOpen ∘ 𝑅)‘𝑦)))
61	15, 19, 2, 37, 60	ptcn 22978	. . 3 ⊢ (𝜑 → (𝑥 ∈ (Base‘𝑌) ↦ (𝑦 ∈ 𝐼 ↦ ((invg‘(𝑅‘𝑦))‘(𝑥‘𝑦)))) ∈ ((TopOpen‘𝑌) Cn (∏t‘(TopOpen ∘ 𝑅))))
62		eqid 2736	. . . . . . 7 ⊢ (invg‘𝑌) = (invg‘𝑌)
63	17, 62	grpinvf 18797	. . . . . 6 ⊢ (𝑌 ∈ Grp → (invg‘𝑌):(Base‘𝑌)⟶(Base‘𝑌))
64	9, 63	syl 17	. . . . 5 ⊢ (𝜑 → (invg‘𝑌):(Base‘𝑌)⟶(Base‘𝑌))
65	64	feqmptd 6910	. . . 4 ⊢ (𝜑 → (invg‘𝑌) = (𝑥 ∈ (Base‘𝑌) ↦ ((invg‘𝑌)‘𝑥)))
66	2	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (Base‘𝑌)) → 𝐼 ∈ 𝑊)
67	3	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (Base‘𝑌)) → 𝑆 ∈ 𝑉)
68	8	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (Base‘𝑌)) → 𝑅:𝐼⟶Grp)
69		simpr 485	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (Base‘𝑌)) → 𝑥 ∈ (Base‘𝑌))
70	1, 66, 67, 68, 17, 62, 69	prdsinvgd 18858	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (Base‘𝑌)) → ((invg‘𝑌)‘𝑥) = (𝑦 ∈ 𝐼 ↦ ((invg‘(𝑅‘𝑦))‘(𝑥‘𝑦))))
71	70	mpteq2dva 5205	. . . 4 ⊢ (𝜑 → (𝑥 ∈ (Base‘𝑌) ↦ ((invg‘𝑌)‘𝑥)) = (𝑥 ∈ (Base‘𝑌) ↦ (𝑦 ∈ 𝐼 ↦ ((invg‘(𝑅‘𝑦))‘(𝑥‘𝑦)))))
72	65, 71	eqtrd 2776	. . 3 ⊢ (𝜑 → (invg‘𝑌) = (𝑥 ∈ (Base‘𝑌) ↦ (𝑦 ∈ 𝐼 ↦ ((invg‘(𝑅‘𝑦))‘(𝑥‘𝑦)))))
73	39	oveq2d 7373	. . 3 ⊢ (𝜑 → ((TopOpen‘𝑌) Cn (TopOpen‘𝑌)) = ((TopOpen‘𝑌) Cn (∏t‘(TopOpen ∘ 𝑅))))
74	61, 72, 73	3eltr4d 2853	. 2 ⊢ (𝜑 → (invg‘𝑌) ∈ ((TopOpen‘𝑌) Cn (TopOpen‘𝑌)))
75	16, 62	istgp 23428	. 2 ⊢ (𝑌 ∈ TopGrp ↔ (𝑌 ∈ Grp ∧ 𝑌 ∈ TopMnd ∧ (invg‘𝑌) ∈ ((TopOpen‘𝑌) Cn (TopOpen‘𝑌))))
76	9, 14, 74, 75	syl3anbrc 1343	1 ⊢ (𝜑 → 𝑌 ∈ TopGrp)

Syntax hints:   → wi 4   ∧ wa 396   = wceq 1541   ∈ wcel 2106  ∀wral 3064  Vcvv 3445   ⊆ wss 3910  ∪ cuni 4865   ↦ cmpt 5188   ∘ ccom 5637   Fn wfn 6491  ⟶wf 6492  ‘cfv 6496  (class class class)co 7357  Basecbs 17083  TopOpenctopn 17303  ∏_tcpt 17320  X_scprds 17327  Grpcgrp 18748  inv_gcminusg 18749  Topctop 22242  TopOnctopon 22259   Cn ccn 22575  TopMndctmd 23421  TopGrpctgp 23422

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-rep 5242  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672  ax-cnex 11107  ax-resscn 11108  ax-1cn 11109  ax-icn 11110  ax-addcl 11111  ax-addrcl 11112  ax-mulcl 11113  ax-mulrcl 11114  ax-mulcom 11115  ax-addass 11116  ax-mulass 11117  ax-distr 11118  ax-i2m1 11119  ax-1ne0 11120  ax-1rid 11121  ax-rnegex 11122  ax-rrecex 11123  ax-cnre 11124  ax-pre-lttri 11125  ax-pre-lttrn 11126  ax-pre-ltadd 11127  ax-pre-mulgt0 11128

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3065  df-rex 3074  df-rmo 3353  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-pss 3929  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-tp 4591  df-op 4593  df-uni 4866  df-int 4908  df-iun 4956  df-iin 4957  df-br 5106  df-opab 5168  df-mpt 5189  df-tr 5223  df-id 5531  df-eprel 5537  df-po 5545  df-so 5546  df-fr 5588  df-we 5590  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-pred 6253  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-riota 7313  df-ov 7360  df-oprab 7361  df-mpo 7362  df-om 7803  df-1st 7921  df-2nd 7922  df-frecs 8212  df-wrecs 8243  df-recs 8317  df-rdg 8356  df-1o 8412  df-er 8648  df-map 8767  df-ixp 8836  df-en 8884  df-dom 8885  df-sdom 8886  df-fin 8887  df-fi 9347  df-sup 9378  df-pnf 11191  df-mnf 11192  df-xr 11193  df-ltxr 11194  df-le 11195  df-sub 11387  df-neg 11388  df-nn 12154  df-2 12216  df-3 12217  df-4 12218  df-5 12219  df-6 12220  df-7 12221  df-8 12222  df-9 12223  df-n0 12414  df-z 12500  df-dec 12619  df-uz 12764  df-fz 13425  df-struct 17019  df-slot 17054  df-ndx 17066  df-base 17084  df-plusg 17146  df-mulr 17147  df-sca 17149  df-vsca 17150  df-ip 17151  df-tset 17152  df-ple 17153  df-ds 17155  df-hom 17157  df-cco 17158  df-rest 17304  df-topn 17305  df-0g 17323  df-topgen 17325  df-pt 17326  df-prds 17329  df-plusf 18496  df-mgm 18497  df-sgrp 18546  df-mnd 18557  df-grp 18751  df-minusg 18752  df-top 22243  df-topon 22260  df-topsp 22282  df-bases 22296  df-cn 22578  df-cnp 22579  df-tx 22913  df-tmd 23423  df-tgp 23424

This theorem is referenced by: (None)