Theorem prdstgpd 22876

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 22829	. . . . 5 ⊢ (𝑥 ∈ TopGrp → 𝑥 ∈ Grp)
6	5	ssriv 3881	. . . 4 ⊢ TopGrp ⊆ Grp
7		fss 6521	. . . 4 ⊢ ((𝑅:𝐼⟶TopGrp ∧ TopGrp ⊆ Grp) → 𝑅:𝐼⟶Grp)
8	4, 6, 7	sylancl 589	. . 3 ⊢ (𝜑 → 𝑅:𝐼⟶Grp)
9	1, 2, 3, 8	prdsgrpd 18327	. 2 ⊢ (𝜑 → 𝑌 ∈ Grp)
10		tgptmd 22830	. . . . 5 ⊢ (𝑥 ∈ TopGrp → 𝑥 ∈ TopMnd)
11	10	ssriv 3881	. . . 4 ⊢ TopGrp ⊆ TopMnd
12		fss 6521	. . . 4 ⊢ ((𝑅:𝐼⟶TopGrp ∧ TopGrp ⊆ TopMnd) → 𝑅:𝐼⟶TopMnd)
13	4, 11, 12	sylancl 589	. . 3 ⊢ (𝜑 → 𝑅:𝐼⟶TopMnd)
14	1, 2, 3, 13	prdstmdd 22875	. 2 ⊢ (𝜑 → 𝑌 ∈ TopMnd)
15		eqid 2738	. . . 4 ⊢ (∏t‘(TopOpen ∘ 𝑅)) = (∏t‘(TopOpen ∘ 𝑅))
16		eqid 2738	. . . . . 6 ⊢ (TopOpen‘𝑌) = (TopOpen‘𝑌)
17		eqid 2738	. . . . . 6 ⊢ (Base‘𝑌) = (Base‘𝑌)
18	16, 17	tmdtopon 22832	. . . . 5 ⊢ (𝑌 ∈ TopMnd → (TopOpen‘𝑌) ∈ (TopOn‘(Base‘𝑌)))
19	14, 18	syl 17	. . . 4 ⊢ (𝜑 → (TopOpen‘𝑌) ∈ (TopOn‘(Base‘𝑌)))
20		topnfn 16802	. . . . . 6 ⊢ TopOpen Fn V
21	4	ffnd 6505	. . . . . . 7 ⊢ (𝜑 → 𝑅 Fn 𝐼)
22		dffn2 6506	. . . . . . 7 ⊢ (𝑅 Fn 𝐼 ↔ 𝑅:𝐼⟶V)
23	21, 22	sylib 221	. . . . . 6 ⊢ (𝜑 → 𝑅:𝐼⟶V)
24		fnfco 6543	. . . . . 6 ⊢ ((TopOpen Fn V ∧ 𝑅:𝐼⟶V) → (TopOpen ∘ 𝑅) Fn 𝐼)
25	20, 23, 24	sylancr 590	. . . . 5 ⊢ (𝜑 → (TopOpen ∘ 𝑅) Fn 𝐼)
26		fvco3 6767	. . . . . . . 8 ⊢ ((𝑅:𝐼⟶TopGrp ∧ 𝑦 ∈ 𝐼) → ((TopOpen ∘ 𝑅)‘𝑦) = (TopOpen‘(𝑅‘𝑦)))
27	4, 26	sylan 583	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → ((TopOpen ∘ 𝑅)‘𝑦) = (TopOpen‘(𝑅‘𝑦)))
28	4	ffvelrnda 6861	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝑅‘𝑦) ∈ TopGrp)
29		eqid 2738	. . . . . . . . 9 ⊢ (TopOpen‘(𝑅‘𝑦)) = (TopOpen‘(𝑅‘𝑦))
30		eqid 2738	. . . . . . . . 9 ⊢ (Base‘(𝑅‘𝑦)) = (Base‘(𝑅‘𝑦))
31	29, 30	tgptopon 22833	. . . . . . . 8 ⊢ ((𝑅‘𝑦) ∈ TopGrp → (TopOpen‘(𝑅‘𝑦)) ∈ (TopOn‘(Base‘(𝑅‘𝑦))))
32		topontop 21664	. . . . . . . 8 ⊢ ((TopOpen‘(𝑅‘𝑦)) ∈ (TopOn‘(Base‘(𝑅‘𝑦))) → (TopOpen‘(𝑅‘𝑦)) ∈ Top)
33	28, 31, 32	3syl 18	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (TopOpen‘(𝑅‘𝑦)) ∈ Top)
34	27, 33	eqeltrd 2833	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → ((TopOpen ∘ 𝑅)‘𝑦) ∈ Top)
35	34	ralrimiva 3096	. . . . 5 ⊢ (𝜑 → ∀𝑦 ∈ 𝐼 ((TopOpen ∘ 𝑅)‘𝑦) ∈ Top)
36		ffnfv 6892	. . . . 5 ⊢ ((TopOpen ∘ 𝑅):𝐼⟶Top ↔ ((TopOpen ∘ 𝑅) Fn 𝐼 ∧ ∀𝑦 ∈ 𝐼 ((TopOpen ∘ 𝑅)‘𝑦) ∈ Top))
37	25, 35, 36	sylanbrc 586	. . . 4 ⊢ (𝜑 → (TopOpen ∘ 𝑅):𝐼⟶Top)
38	19	adantr 484	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (TopOpen‘𝑌) ∈ (TopOn‘(Base‘𝑌)))
39	1, 3, 2, 21, 16	prdstopn 22379	. . . . . . . . . . . 12 ⊢ (𝜑 → (TopOpen‘𝑌) = (∏t‘(TopOpen ∘ 𝑅)))
40	39	adantr 484	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (TopOpen‘𝑌) = (∏t‘(TopOpen ∘ 𝑅)))
41	40	eqcomd 2744	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (∏t‘(TopOpen ∘ 𝑅)) = (TopOpen‘𝑌))
42	41, 38	eqeltrd 2833	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (∏t‘(TopOpen ∘ 𝑅)) ∈ (TopOn‘(Base‘𝑌)))
43		toponuni 21665	. . . . . . . . 9 ⊢ ((∏t‘(TopOpen ∘ 𝑅)) ∈ (TopOn‘(Base‘𝑌)) → (Base‘𝑌) = ∪ (∏t‘(TopOpen ∘ 𝑅)))
44		mpteq1 5118	. . . . . . . . 9 ⊢ ((Base‘𝑌) = ∪ (∏t‘(TopOpen ∘ 𝑅)) → (𝑥 ∈ (Base‘𝑌) ↦ (𝑥‘𝑦)) = (𝑥 ∈ ∪ (∏t‘(TopOpen ∘ 𝑅)) ↦ (𝑥‘𝑦)))
45	42, 43, 44	3syl 18	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝑥 ∈ (Base‘𝑌) ↦ (𝑥‘𝑦)) = (𝑥 ∈ ∪ (∏t‘(TopOpen ∘ 𝑅)) ↦ (𝑥‘𝑦)))
46	2	adantr 484	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → 𝐼 ∈ 𝑊)
47	37	adantr 484	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (TopOpen ∘ 𝑅):𝐼⟶Top)
48		simpr 488	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → 𝑦 ∈ 𝐼)
49		eqid 2738	. . . . . . . . . 10 ⊢ ∪ (∏t‘(TopOpen ∘ 𝑅)) = ∪ (∏t‘(TopOpen ∘ 𝑅))
50	49, 15	ptpjcn 22362	. . . . . . . . 9 ⊢ ((𝐼 ∈ 𝑊 ∧ (TopOpen ∘ 𝑅):𝐼⟶Top ∧ 𝑦 ∈ 𝐼) → (𝑥 ∈ ∪ (∏t‘(TopOpen ∘ 𝑅)) ↦ (𝑥‘𝑦)) ∈ ((∏t‘(TopOpen ∘ 𝑅)) Cn ((TopOpen ∘ 𝑅)‘𝑦)))
51	46, 47, 48, 50	syl3anc 1372	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝑥 ∈ ∪ (∏t‘(TopOpen ∘ 𝑅)) ↦ (𝑥‘𝑦)) ∈ ((∏t‘(TopOpen ∘ 𝑅)) Cn ((TopOpen ∘ 𝑅)‘𝑦)))
52	45, 51	eqeltrd 2833	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝑥 ∈ (Base‘𝑌) ↦ (𝑥‘𝑦)) ∈ ((∏t‘(TopOpen ∘ 𝑅)) Cn ((TopOpen ∘ 𝑅)‘𝑦)))
53	41, 27	oveq12d 7188	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → ((∏t‘(TopOpen ∘ 𝑅)) Cn ((TopOpen ∘ 𝑅)‘𝑦)) = ((TopOpen‘𝑌) Cn (TopOpen‘(𝑅‘𝑦))))
54	52, 53	eleqtrd 2835	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝑥 ∈ (Base‘𝑌) ↦ (𝑥‘𝑦)) ∈ ((TopOpen‘𝑌) Cn (TopOpen‘(𝑅‘𝑦))))
55		eqid 2738	. . . . . . . 8 ⊢ (invg‘(𝑅‘𝑦)) = (invg‘(𝑅‘𝑦))
56	29, 55	tgpinv 22836	. . . . . . 7 ⊢ ((𝑅‘𝑦) ∈ TopGrp → (invg‘(𝑅‘𝑦)) ∈ ((TopOpen‘(𝑅‘𝑦)) Cn (TopOpen‘(𝑅‘𝑦))))
57	28, 56	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (invg‘(𝑅‘𝑦)) ∈ ((TopOpen‘(𝑅‘𝑦)) Cn (TopOpen‘(𝑅‘𝑦))))
58	38, 54, 57	cnmpt11f 22415	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝑥 ∈ (Base‘𝑌) ↦ ((invg‘(𝑅‘𝑦))‘(𝑥‘𝑦))) ∈ ((TopOpen‘𝑌) Cn (TopOpen‘(𝑅‘𝑦))))
59	27	oveq2d 7186	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → ((TopOpen‘𝑌) Cn ((TopOpen ∘ 𝑅)‘𝑦)) = ((TopOpen‘𝑌) Cn (TopOpen‘(𝑅‘𝑦))))
60	58, 59	eleqtrrd 2836	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝑥 ∈ (Base‘𝑌) ↦ ((invg‘(𝑅‘𝑦))‘(𝑥‘𝑦))) ∈ ((TopOpen‘𝑌) Cn ((TopOpen ∘ 𝑅)‘𝑦)))
61	15, 19, 2, 37, 60	ptcn 22378	. . 3 ⊢ (𝜑 → (𝑥 ∈ (Base‘𝑌) ↦ (𝑦 ∈ 𝐼 ↦ ((invg‘(𝑅‘𝑦))‘(𝑥‘𝑦)))) ∈ ((TopOpen‘𝑌) Cn (∏t‘(TopOpen ∘ 𝑅))))
62		eqid 2738	. . . . . . 7 ⊢ (invg‘𝑌) = (invg‘𝑌)
63	17, 62	grpinvf 18268	. . . . . 6 ⊢ (𝑌 ∈ Grp → (invg‘𝑌):(Base‘𝑌)⟶(Base‘𝑌))
64	9, 63	syl 17	. . . . 5 ⊢ (𝜑 → (invg‘𝑌):(Base‘𝑌)⟶(Base‘𝑌))
65	64	feqmptd 6737	. . . 4 ⊢ (𝜑 → (invg‘𝑌) = (𝑥 ∈ (Base‘𝑌) ↦ ((invg‘𝑌)‘𝑥)))
66	2	adantr 484	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (Base‘𝑌)) → 𝐼 ∈ 𝑊)
67	3	adantr 484	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (Base‘𝑌)) → 𝑆 ∈ 𝑉)
68	8	adantr 484	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (Base‘𝑌)) → 𝑅:𝐼⟶Grp)
69		simpr 488	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (Base‘𝑌)) → 𝑥 ∈ (Base‘𝑌))
70	1, 66, 67, 68, 17, 62, 69	prdsinvgd 18328	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (Base‘𝑌)) → ((invg‘𝑌)‘𝑥) = (𝑦 ∈ 𝐼 ↦ ((invg‘(𝑅‘𝑦))‘(𝑥‘𝑦))))
71	70	mpteq2dva 5125	. . . 4 ⊢ (𝜑 → (𝑥 ∈ (Base‘𝑌) ↦ ((invg‘𝑌)‘𝑥)) = (𝑥 ∈ (Base‘𝑌) ↦ (𝑦 ∈ 𝐼 ↦ ((invg‘(𝑅‘𝑦))‘(𝑥‘𝑦)))))
72	65, 71	eqtrd 2773	. . 3 ⊢ (𝜑 → (invg‘𝑌) = (𝑥 ∈ (Base‘𝑌) ↦ (𝑦 ∈ 𝐼 ↦ ((invg‘(𝑅‘𝑦))‘(𝑥‘𝑦)))))
73	39	oveq2d 7186	. . 3 ⊢ (𝜑 → ((TopOpen‘𝑌) Cn (TopOpen‘𝑌)) = ((TopOpen‘𝑌) Cn (∏t‘(TopOpen ∘ 𝑅))))
74	61, 72, 73	3eltr4d 2848	. 2 ⊢ (𝜑 → (invg‘𝑌) ∈ ((TopOpen‘𝑌) Cn (TopOpen‘𝑌)))
75	16, 62	istgp 22828	. 2 ⊢ (𝑌 ∈ TopGrp ↔ (𝑌 ∈ Grp ∧ 𝑌 ∈ TopMnd ∧ (invg‘𝑌) ∈ ((TopOpen‘𝑌) Cn (TopOpen‘𝑌))))
76	9, 14, 74, 75	syl3anbrc 1344	1 ⊢ (𝜑 → 𝑌 ∈ TopGrp)

Syntax hints:   → wi 4   ∧ wa 399   = wceq 1542   ∈ wcel 2114  ∀wral 3053  Vcvv 3398   ⊆ wss 3843  ∪ cuni 4796   ↦ cmpt 5110   ∘ ccom 5529   Fn wfn 6334  ⟶wf 6335  ‘cfv 6339  (class class class)co 7170  Basecbs 16586  TopOpenctopn 16798  ∏_tcpt 16815  X_scprds 16822  Grpcgrp 18219  inv_gcminusg 18220  Topctop 21644  TopOnctopon 21661   Cn ccn 21975  TopMndctmd 22821  TopGrpctgp 22822

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1975  ax-7 2020  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2162  ax-12 2179  ax-ext 2710  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5232  ax-pr 5296  ax-un 7479  ax-cnex 10671  ax-resscn 10672  ax-1cn 10673  ax-icn 10674  ax-addcl 10675  ax-addrcl 10676  ax-mulcl 10677  ax-mulrcl 10678  ax-mulcom 10679  ax-addass 10680  ax-mulass 10681  ax-distr 10682  ax-i2m1 10683  ax-1ne0 10684  ax-1rid 10685  ax-rnegex 10686  ax-rrecex 10687  ax-cnre 10688  ax-pre-lttri 10689  ax-pre-lttrn 10690  ax-pre-ltadd 10691  ax-pre-mulgt0 10692

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1787  df-nf 1791  df-sb 2075  df-mo 2540  df-eu 2570  df-clab 2717  df-cleq 2730  df-clel 2811  df-nfc 2881  df-ne 2935  df-nel 3039  df-ral 3058  df-rex 3059  df-reu 3060  df-rmo 3061  df-rab 3062  df-v 3400  df-sbc 3681  df-csb 3791  df-dif 3846  df-un 3848  df-in 3850  df-ss 3860  df-pss 3862  df-nul 4212  df-if 4415  df-pw 4490  df-sn 4517  df-pr 4519  df-tp 4521  df-op 4523  df-uni 4797  df-int 4837  df-iun 4883  df-iin 4884  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5429  df-eprel 5434  df-po 5442  df-so 5443  df-fr 5483  df-we 5485  df-xp 5531  df-rel 5532  df-cnv 5533  df-co 5534  df-dm 5535  df-rn 5536  df-res 5537  df-ima 5538  df-pred 6129  df-ord 6175  df-on 6176  df-lim 6177  df-suc 6178  df-iota 6297  df-fun 6341  df-fn 6342  df-f 6343  df-f1 6344  df-fo 6345  df-f1o 6346  df-fv 6347  df-riota 7127  df-ov 7173  df-oprab 7174  df-mpo 7175  df-om 7600  df-1st 7714  df-2nd 7715  df-wrecs 7976  df-recs 8037  df-rdg 8075  df-1o 8131  df-er 8320  df-map 8439  df-ixp 8508  df-en 8556  df-dom 8557  df-sdom 8558  df-fin 8559  df-fi 8948  df-sup 8979  df-pnf 10755  df-mnf 10756  df-xr 10757  df-ltxr 10758  df-le 10759  df-sub 10950  df-neg 10951  df-nn 11717  df-2 11779  df-3 11780  df-4 11781  df-5 11782  df-6 11783  df-7 11784  df-8 11785  df-9 11786  df-n0 11977  df-z 12063  df-dec 12180  df-uz 12325  df-fz 12982  df-struct 16588  df-ndx 16589  df-slot 16590  df-base 16592  df-plusg 16681  df-mulr 16682  df-sca 16684  df-vsca 16685  df-ip 16686  df-tset 16687  df-ple 16688  df-ds 16690  df-hom 16692  df-cco 16693  df-rest 16799  df-topn 16800  df-0g 16818  df-topgen 16820  df-pt 16821  df-prds 16824  df-plusf 17967  df-mgm 17968  df-sgrp 18017  df-mnd 18028  df-grp 18222  df-minusg 18223  df-top 21645  df-topon 21662  df-topsp 21684  df-bases 21697  df-cn 21978  df-cnp 21979  df-tx 22313  df-tmd 22823  df-tgp 22824

This theorem is referenced by: (None)