prdstgpd - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > prdstgpd		Structured version Visualization version GIF version

Theorem prdstgpd 23629

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	⊢ 𝑌 = (𝑆X_s𝑅)
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 ⊢ 𝑌 = (𝑆X_s𝑅)
2		prdstgpd.i	. . 3 ⊢ (𝜑 → 𝐼 ∈ 𝑊)
3		prdstgpd.s	. . 3 ⊢ (𝜑 → 𝑆 ∈ 𝑉)
4		prdstgpd.r	. . . 4 ⊢ (𝜑 → 𝑅:𝐼⟶TopGrp)
5		tgpgrp 23582	. . . . 5 ⊢ (𝑥 ∈ TopGrp → 𝑥 ∈ Grp)
6	5	ssriv 3987	. . . 4 ⊢ TopGrp ⊆ Grp
7		fss 6735	. . . 4 ⊢ ((𝑅:𝐼⟶TopGrp ∧ TopGrp ⊆ Grp) → 𝑅:𝐼⟶Grp)
8	4, 6, 7	sylancl 587	. . 3 ⊢ (𝜑 → 𝑅:𝐼⟶Grp)
9	1, 2, 3, 8	prdsgrpd 18933	. 2 ⊢ (𝜑 → 𝑌 ∈ Grp)
10		tgptmd 23583	. . . . 5 ⊢ (𝑥 ∈ TopGrp → 𝑥 ∈ TopMnd)
11	10	ssriv 3987	. . . 4 ⊢ TopGrp ⊆ TopMnd
12		fss 6735	. . . 4 ⊢ ((𝑅:𝐼⟶TopGrp ∧ TopGrp ⊆ TopMnd) → 𝑅:𝐼⟶TopMnd)
13	4, 11, 12	sylancl 587	. . 3 ⊢ (𝜑 → 𝑅:𝐼⟶TopMnd)
14	1, 2, 3, 13	prdstmdd 23628	. 2 ⊢ (𝜑 → 𝑌 ∈ TopMnd)
15		eqid 2733	. . . 4 ⊢ (∏_t‘(TopOpen ∘ 𝑅)) = (∏_t‘(TopOpen ∘ 𝑅))
16		eqid 2733	. . . . . 6 ⊢ (TopOpen‘𝑌) = (TopOpen‘𝑌)
17		eqid 2733	. . . . . 6 ⊢ (Base‘𝑌) = (Base‘𝑌)
18	16, 17	tmdtopon 23585	. . . . 5 ⊢ (𝑌 ∈ TopMnd → (TopOpen‘𝑌) ∈ (TopOn‘(Base‘𝑌)))
19	14, 18	syl 17	. . . 4 ⊢ (𝜑 → (TopOpen‘𝑌) ∈ (TopOn‘(Base‘𝑌)))
20		topnfn 17371	. . . . . 6 ⊢ TopOpen Fn V
21	4	ffnd 6719	. . . . . . 7 ⊢ (𝜑 → 𝑅 Fn 𝐼)
22		dffn2 6720	. . . . . . 7 ⊢ (𝑅 Fn 𝐼 ↔ 𝑅:𝐼⟶V)
23	21, 22	sylib 217	. . . . . 6 ⊢ (𝜑 → 𝑅:𝐼⟶V)
24		fnfco 6757	. . . . . 6 ⊢ ((TopOpen Fn V ∧ 𝑅:𝐼⟶V) → (TopOpen ∘ 𝑅) Fn 𝐼)
25	20, 23, 24	sylancr 588	. . . . 5 ⊢ (𝜑 → (TopOpen ∘ 𝑅) Fn 𝐼)
26		fvco3 6991	. . . . . . . 8 ⊢ ((𝑅:𝐼⟶TopGrp ∧ 𝑦 ∈ 𝐼) → ((TopOpen ∘ 𝑅)‘𝑦) = (TopOpen‘(𝑅‘𝑦)))
27	4, 26	sylan 581	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → ((TopOpen ∘ 𝑅)‘𝑦) = (TopOpen‘(𝑅‘𝑦)))
28	4	ffvelcdmda 7087	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝑅‘𝑦) ∈ TopGrp)
29		eqid 2733	. . . . . . . . 9 ⊢ (TopOpen‘(𝑅‘𝑦)) = (TopOpen‘(𝑅‘𝑦))
30		eqid 2733	. . . . . . . . 9 ⊢ (Base‘(𝑅‘𝑦)) = (Base‘(𝑅‘𝑦))
31	29, 30	tgptopon 23586	. . . . . . . 8 ⊢ ((𝑅‘𝑦) ∈ TopGrp → (TopOpen‘(𝑅‘𝑦)) ∈ (TopOn‘(Base‘(𝑅‘𝑦))))
32		topontop 22415	. . . . . . . 8 ⊢ ((TopOpen‘(𝑅‘𝑦)) ∈ (TopOn‘(Base‘(𝑅‘𝑦))) → (TopOpen‘(𝑅‘𝑦)) ∈ Top)
33	28, 31, 32	3syl 18	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (TopOpen‘(𝑅‘𝑦)) ∈ Top)
34	27, 33	eqeltrd 2834	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → ((TopOpen ∘ 𝑅)‘𝑦) ∈ Top)
35	34	ralrimiva 3147	. . . . 5 ⊢ (𝜑 → ∀𝑦 ∈ 𝐼 ((TopOpen ∘ 𝑅)‘𝑦) ∈ Top)
36		ffnfv 7118	. . . . 5 ⊢ ((TopOpen ∘ 𝑅):𝐼⟶Top ↔ ((TopOpen ∘ 𝑅) Fn 𝐼 ∧ ∀𝑦 ∈ 𝐼 ((TopOpen ∘ 𝑅)‘𝑦) ∈ Top))
37	25, 35, 36	sylanbrc 584	. . . 4 ⊢ (𝜑 → (TopOpen ∘ 𝑅):𝐼⟶Top)
38	19	adantr 482	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (TopOpen‘𝑌) ∈ (TopOn‘(Base‘𝑌)))
39	1, 3, 2, 21, 16	prdstopn 23132	. . . . . . . . . . . 12 ⊢ (𝜑 → (TopOpen‘𝑌) = (∏_t‘(TopOpen ∘ 𝑅)))
40	39	adantr 482	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (TopOpen‘𝑌) = (∏_t‘(TopOpen ∘ 𝑅)))
41	40	eqcomd 2739	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (∏_t‘(TopOpen ∘ 𝑅)) = (TopOpen‘𝑌))
42	41, 38	eqeltrd 2834	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (∏_t‘(TopOpen ∘ 𝑅)) ∈ (TopOn‘(Base‘𝑌)))
43		toponuni 22416	. . . . . . . . 9 ⊢ ((∏_t‘(TopOpen ∘ 𝑅)) ∈ (TopOn‘(Base‘𝑌)) → (Base‘𝑌) = ∪ (∏_t‘(TopOpen ∘ 𝑅)))
44		mpteq1 5242	. . . . . . . . 9 ⊢ ((Base‘𝑌) = ∪ (∏_t‘(TopOpen ∘ 𝑅)) → (𝑥 ∈ (Base‘𝑌) ↦ (𝑥‘𝑦)) = (𝑥 ∈ ∪ (∏_t‘(TopOpen ∘ 𝑅)) ↦ (𝑥‘𝑦)))
45	42, 43, 44	3syl 18	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝑥 ∈ (Base‘𝑌) ↦ (𝑥‘𝑦)) = (𝑥 ∈ ∪ (∏_t‘(TopOpen ∘ 𝑅)) ↦ (𝑥‘𝑦)))
46	2	adantr 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → 𝐼 ∈ 𝑊)
47	37	adantr 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (TopOpen ∘ 𝑅):𝐼⟶Top)
48		simpr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → 𝑦 ∈ 𝐼)
49		eqid 2733	. . . . . . . . . 10 ⊢ ∪ (∏_t‘(TopOpen ∘ 𝑅)) = ∪ (∏_t‘(TopOpen ∘ 𝑅))
50	49, 15	ptpjcn 23115	. . . . . . . . 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 2834	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝑥 ∈ (Base‘𝑌) ↦ (𝑥‘𝑦)) ∈ ((∏_t‘(TopOpen ∘ 𝑅)) Cn ((TopOpen ∘ 𝑅)‘𝑦)))
53	41, 27	oveq12d 7427	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → ((∏_t‘(TopOpen ∘ 𝑅)) Cn ((TopOpen ∘ 𝑅)‘𝑦)) = ((TopOpen‘𝑌) Cn (TopOpen‘(𝑅‘𝑦))))
54	52, 53	eleqtrd 2836	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝑥 ∈ (Base‘𝑌) ↦ (𝑥‘𝑦)) ∈ ((TopOpen‘𝑌) Cn (TopOpen‘(𝑅‘𝑦))))
55		eqid 2733	. . . . . . . 8 ⊢ (inv_g‘(𝑅‘𝑦)) = (inv_g‘(𝑅‘𝑦))
56	29, 55	tgpinv 23589	. . . . . . 7 ⊢ ((𝑅‘𝑦) ∈ TopGrp → (inv_g‘(𝑅‘𝑦)) ∈ ((TopOpen‘(𝑅‘𝑦)) Cn (TopOpen‘(𝑅‘𝑦))))
57	28, 56	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (inv_g‘(𝑅‘𝑦)) ∈ ((TopOpen‘(𝑅‘𝑦)) Cn (TopOpen‘(𝑅‘𝑦))))
58	38, 54, 57	cnmpt11f 23168	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝑥 ∈ (Base‘𝑌) ↦ ((inv_g‘(𝑅‘𝑦))‘(𝑥‘𝑦))) ∈ ((TopOpen‘𝑌) Cn (TopOpen‘(𝑅‘𝑦))))
59	27	oveq2d 7425	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → ((TopOpen‘𝑌) Cn ((TopOpen ∘ 𝑅)‘𝑦)) = ((TopOpen‘𝑌) Cn (TopOpen‘(𝑅‘𝑦))))
60	58, 59	eleqtrrd 2837	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝑥 ∈ (Base‘𝑌) ↦ ((inv_g‘(𝑅‘𝑦))‘(𝑥‘𝑦))) ∈ ((TopOpen‘𝑌) Cn ((TopOpen ∘ 𝑅)‘𝑦)))
61	15, 19, 2, 37, 60	ptcn 23131	. . 3 ⊢ (𝜑 → (𝑥 ∈ (Base‘𝑌) ↦ (𝑦 ∈ 𝐼 ↦ ((inv_g‘(𝑅‘𝑦))‘(𝑥‘𝑦)))) ∈ ((TopOpen‘𝑌) Cn (∏_t‘(TopOpen ∘ 𝑅))))
62		eqid 2733	. . . . . . 7 ⊢ (inv_g‘𝑌) = (inv_g‘𝑌)
63	17, 62	grpinvf 18871	. . . . . 6 ⊢ (𝑌 ∈ Grp → (inv_g‘𝑌):(Base‘𝑌)⟶(Base‘𝑌))
64	9, 63	syl 17	. . . . 5 ⊢ (𝜑 → (inv_g‘𝑌):(Base‘𝑌)⟶(Base‘𝑌))
65	64	feqmptd 6961	. . . 4 ⊢ (𝜑 → (inv_g‘𝑌) = (𝑥 ∈ (Base‘𝑌) ↦ ((inv_g‘𝑌)‘𝑥)))
66	2	adantr 482	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (Base‘𝑌)) → 𝐼 ∈ 𝑊)
67	3	adantr 482	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (Base‘𝑌)) → 𝑆 ∈ 𝑉)
68	8	adantr 482	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (Base‘𝑌)) → 𝑅:𝐼⟶Grp)
69		simpr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (Base‘𝑌)) → 𝑥 ∈ (Base‘𝑌))
70	1, 66, 67, 68, 17, 62, 69	prdsinvgd 18934	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (Base‘𝑌)) → ((inv_g‘𝑌)‘𝑥) = (𝑦 ∈ 𝐼 ↦ ((inv_g‘(𝑅‘𝑦))‘(𝑥‘𝑦))))
71	70	mpteq2dva 5249	. . . 4 ⊢ (𝜑 → (𝑥 ∈ (Base‘𝑌) ↦ ((inv_g‘𝑌)‘𝑥)) = (𝑥 ∈ (Base‘𝑌) ↦ (𝑦 ∈ 𝐼 ↦ ((inv_g‘(𝑅‘𝑦))‘(𝑥‘𝑦)))))
72	65, 71	eqtrd 2773	. . 3 ⊢ (𝜑 → (inv_g‘𝑌) = (𝑥 ∈ (Base‘𝑌) ↦ (𝑦 ∈ 𝐼 ↦ ((inv_g‘(𝑅‘𝑦))‘(𝑥‘𝑦)))))
73	39	oveq2d 7425	. . 3 ⊢ (𝜑 → ((TopOpen‘𝑌) Cn (TopOpen‘𝑌)) = ((TopOpen‘𝑌) Cn (∏_t‘(TopOpen ∘ 𝑅))))
74	61, 72, 73	3eltr4d 2849	. 2 ⊢ (𝜑 → (inv_g‘𝑌) ∈ ((TopOpen‘𝑌) Cn (TopOpen‘𝑌)))
75	16, 62	istgp 23581	. 2 ⊢ (𝑌 ∈ TopGrp ↔ (𝑌 ∈ Grp ∧ 𝑌 ∈ TopMnd ∧ (inv_g‘𝑌) ∈ ((TopOpen‘𝑌) Cn (TopOpen‘𝑌))))
76	9, 14, 74, 75	syl3anbrc 1344	1 ⊢ (𝜑 → 𝑌 ∈ TopGrp)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 397 = wceq 1542 ∈ wcel 2107 ∀wral 3062 Vcvv 3475 ⊆ wss 3949 ∪ cuni 4909 ↦ cmpt 5232 ∘ ccom 5681 Fn wfn 6539 ⟶wf 6540 ‘cfv 6544 (class class class)co 7409 Basecbs 17144 TopOpenctopn 17367 ∏_tcpt 17384 X_scprds 17391 Grpcgrp 18819 inv_gcminusg 18820 Topctop 22395 TopOnctopon 22412 Cn ccn 22728 TopMndctmd 23574 TopGrpctgp 23575

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-tp 4634 df-op 4636 df-uni 4910 df-int 4952 df-iun 5000 df-iin 5001 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7856 df-1st 7975 df-2nd 7976 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-1o 8466 df-er 8703 df-map 8822 df-ixp 8892 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-fi 9406 df-sup 9437 df-pnf 11250 df-mnf 11251 df-xr 11252 df-ltxr 11253 df-le 11254 df-sub 11446 df-neg 11447 df-nn 12213 df-2 12275 df-3 12276 df-4 12277 df-5 12278 df-6 12279 df-7 12280 df-8 12281 df-9 12282 df-n0 12473 df-z 12559 df-dec 12678 df-uz 12823 df-fz 13485 df-struct 17080 df-slot 17115 df-ndx 17127 df-base 17145 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 17368 df-topn 17369 df-0g 17387 df-topgen 17389 df-pt 17390 df-prds 17393 df-plusf 18560 df-mgm 18561 df-sgrp 18610 df-mnd 18626 df-grp 18822 df-minusg 18823 df-top 22396 df-topon 22413 df-topsp 22435 df-bases 22449 df-cn 22731 df-cnp 22732 df-tx 23066 df-tmd 23576 df-tgp 23577

This theorem is referenced by: (None)

W3C validator