imastopn - Metamath Proof Explorer

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

Theorem imastopn 23658

Description: The topology of an image structure. (Contributed by Mario Carneiro, 27-Aug-2015.)

**Hypotheses**
Ref	Expression
imastps.u	⊢ (𝜑 → 𝑈 = (𝐹 “_s 𝑅))
imastps.v	⊢ (𝜑 → 𝑉 = (Base‘𝑅))
imastps.f	⊢ (𝜑 → 𝐹:𝑉–onto→𝐵)
imastopn.r	⊢ (𝜑 → 𝑅 ∈ 𝑊)
imastopn.j	⊢ 𝐽 = (TopOpen‘𝑅)
imastopn.o	⊢ 𝑂 = (TopOpen‘𝑈)

**Assertion**
Ref	Expression
imastopn	⊢ (𝜑 → 𝑂 = (𝐽 qTop 𝐹))

Proof of Theorem imastopn Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		imastps.u	. . . . . . 7 ⊢ (𝜑 → 𝑈 = (𝐹 “_s 𝑅))
2		imastps.v	. . . . . . 7 ⊢ (𝜑 → 𝑉 = (Base‘𝑅))
3		imastps.f	. . . . . . 7 ⊢ (𝜑 → 𝐹:𝑉–onto→𝐵)
4		imastopn.r	. . . . . . 7 ⊢ (𝜑 → 𝑅 ∈ 𝑊)
5		imastopn.j	. . . . . . 7 ⊢ 𝐽 = (TopOpen‘𝑅)
6		eqid 2735	. . . . . . 7 ⊢ (TopSet‘𝑈) = (TopSet‘𝑈)
7	1, 2, 3, 4, 5, 6	imastset 17536	. . . . . 6 ⊢ (𝜑 → (TopSet‘𝑈) = (𝐽 qTop 𝐹))
8	5	fvexi 6890	. . . . . . 7 ⊢ 𝐽 ∈ V
9		fofn 6792	. . . . . . . . 9 ⊢ (𝐹:𝑉–onto→𝐵 → 𝐹 Fn 𝑉)
10	3, 9	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝐹 Fn 𝑉)
11		fvex 6889	. . . . . . . . 9 ⊢ (Base‘𝑅) ∈ V
12	2, 11	eqeltrdi 2842	. . . . . . . 8 ⊢ (𝜑 → 𝑉 ∈ V)
13		fnex 7209	. . . . . . . 8 ⊢ ((𝐹 Fn 𝑉 ∧ 𝑉 ∈ V) → 𝐹 ∈ V)
14	10, 12, 13	syl2anc 584	. . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ V)
15		eqid 2735	. . . . . . . 8 ⊢ ∪ 𝐽 = ∪ 𝐽
16	15	qtopval 23633	. . . . . . 7 ⊢ ((𝐽 ∈ V ∧ 𝐹 ∈ V) → (𝐽 qTop 𝐹) = {𝑥 ∈ 𝒫 (𝐹 “ ∪ 𝐽) ∣ ((^◡𝐹 “ 𝑥) ∩ ∪ 𝐽) ∈ 𝐽})
17	8, 14, 16	sylancr 587	. . . . . 6 ⊢ (𝜑 → (𝐽 qTop 𝐹) = {𝑥 ∈ 𝒫 (𝐹 “ ∪ 𝐽) ∣ ((^◡𝐹 “ 𝑥) ∩ ∪ 𝐽) ∈ 𝐽})
18	7, 17	eqtrd 2770	. . . . 5 ⊢ (𝜑 → (TopSet‘𝑈) = {𝑥 ∈ 𝒫 (𝐹 “ ∪ 𝐽) ∣ ((^◡𝐹 “ 𝑥) ∩ ∪ 𝐽) ∈ 𝐽})
19		ssrab2 4055	. . . . . 6 ⊢ {𝑥 ∈ 𝒫 (𝐹 “ ∪ 𝐽) ∣ ((^◡𝐹 “ 𝑥) ∩ ∪ 𝐽) ∈ 𝐽} ⊆ 𝒫 (𝐹 “ ∪ 𝐽)
20		imassrn 6058	. . . . . . . 8 ⊢ (𝐹 “ ∪ 𝐽) ⊆ ran 𝐹
21		forn 6793	. . . . . . . . . 10 ⊢ (𝐹:𝑉–onto→𝐵 → ran 𝐹 = 𝐵)
22	3, 21	syl 17	. . . . . . . . 9 ⊢ (𝜑 → ran 𝐹 = 𝐵)
23	1, 2, 3, 4	imasbas 17526	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 = (Base‘𝑈))
24	22, 23	eqtrd 2770	. . . . . . . 8 ⊢ (𝜑 → ran 𝐹 = (Base‘𝑈))
25	20, 24	sseqtrid 4001	. . . . . . 7 ⊢ (𝜑 → (𝐹 “ ∪ 𝐽) ⊆ (Base‘𝑈))
26	25	sspwd 4588	. . . . . 6 ⊢ (𝜑 → 𝒫 (𝐹 “ ∪ 𝐽) ⊆ 𝒫 (Base‘𝑈))
27	19, 26	sstrid 3970	. . . . 5 ⊢ (𝜑 → {𝑥 ∈ 𝒫 (𝐹 “ ∪ 𝐽) ∣ ((^◡𝐹 “ 𝑥) ∩ ∪ 𝐽) ∈ 𝐽} ⊆ 𝒫 (Base‘𝑈))
28	18, 27	eqsstrd 3993	. . . 4 ⊢ (𝜑 → (TopSet‘𝑈) ⊆ 𝒫 (Base‘𝑈))
29		eqid 2735	. . . . 5 ⊢ (Base‘𝑈) = (Base‘𝑈)
30	29, 6	topnid 17449	. . . 4 ⊢ ((TopSet‘𝑈) ⊆ 𝒫 (Base‘𝑈) → (TopSet‘𝑈) = (TopOpen‘𝑈))
31	28, 30	syl 17	. . 3 ⊢ (𝜑 → (TopSet‘𝑈) = (TopOpen‘𝑈))
32		imastopn.o	. . 3 ⊢ 𝑂 = (TopOpen‘𝑈)
33	31, 32	eqtr4di 2788	. 2 ⊢ (𝜑 → (TopSet‘𝑈) = 𝑂)
34	33, 7	eqtr3d 2772	1 ⊢ (𝜑 → 𝑂 = (𝐽 qTop 𝐹))

Colors of variables: wff setvar class

Syntax hints: → wi 4 = wceq 1540 ∈ wcel 2108 {crab 3415 Vcvv 3459 ∩ cin 3925 ⊆ wss 3926 𝒫 cpw 4575 ∪ cuni 4883 ^◡ccnv 5653 ran crn 5655 “ cima 5657 Fn wfn 6526 –onto→wfo 6529 ‘cfv 6531 (class class class)co 7405 Basecbs 17228 TopSetcts 17277 TopOpenctopn 17435 qTop cqtop 17517 “_s cimas 17518

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 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-rep 5249 ax-sep 5266 ax-nul 5276 ax-pow 5335 ax-pr 5402 ax-un 7729 ax-cnex 11185 ax-resscn 11186 ax-1cn 11187 ax-icn 11188 ax-addcl 11189 ax-addrcl 11190 ax-mulcl 11191 ax-mulrcl 11192 ax-mulcom 11193 ax-addass 11194 ax-mulass 11195 ax-distr 11196 ax-i2m1 11197 ax-1ne0 11198 ax-1rid 11199 ax-rnegex 11200 ax-rrecex 11201 ax-cnre 11202 ax-pre-lttri 11203 ax-pre-lttrn 11204 ax-pre-ltadd 11205 ax-pre-mulgt0 11206

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 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-reu 3360 df-rab 3416 df-v 3461 df-sbc 3766 df-csb 3875 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-pss 3946 df-nul 4309 df-if 4501 df-pw 4577 df-sn 4602 df-pr 4604 df-tp 4606 df-op 4608 df-uni 4884 df-iun 4969 df-br 5120 df-opab 5182 df-mpt 5202 df-tr 5230 df-id 5548 df-eprel 5553 df-po 5561 df-so 5562 df-fr 5606 df-we 5608 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6290 df-ord 6355 df-on 6356 df-lim 6357 df-suc 6358 df-iota 6484 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-riota 7362 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7862 df-1st 7988 df-2nd 7989 df-frecs 8280 df-wrecs 8311 df-recs 8385 df-rdg 8424 df-1o 8480 df-er 8719 df-en 8960 df-dom 8961 df-sdom 8962 df-fin 8963 df-sup 9454 df-inf 9455 df-pnf 11271 df-mnf 11272 df-xr 11273 df-ltxr 11274 df-le 11275 df-sub 11468 df-neg 11469 df-nn 12241 df-2 12303 df-3 12304 df-4 12305 df-5 12306 df-6 12307 df-7 12308 df-8 12309 df-9 12310 df-n0 12502 df-z 12589 df-dec 12709 df-uz 12853 df-fz 13525 df-struct 17166 df-slot 17201 df-ndx 17213 df-base 17229 df-plusg 17284 df-mulr 17285 df-sca 17287 df-vsca 17288 df-ip 17289 df-tset 17290 df-ple 17291 df-ds 17293 df-rest 17436 df-topn 17437 df-qtop 17521 df-imas 17522

This theorem is referenced by: imastps 23659 xpstopnlem2 23749 qustgpopn 24058 qustgplem 24059 qustgphaus 24061 imasf1oxms 24428

W3C validator