Theorem qtopcld 23923

Description: The property of being a closed set in the quotient topology. (Contributed by Mario Carneiro, 24-Mar-2015.)

Assertion

Ref	Expression
qtopcld	⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋–onto→𝑌) → (𝐴 ∈ (Clsd‘(𝐽 qTop 𝐹)) ↔ (𝐴 ⊆ 𝑌 ∧ (◡𝐹 “ 𝐴) ∈ (Clsd‘𝐽))))

Proof of Theorem qtopcld

Step	Hyp	Ref	Expression
1		qtoptopon 23914	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋–onto→𝑌) → (𝐽 qTop 𝐹) ∈ (TopOn‘𝑌))
2		topontop 23122	. . 3 ⊢ ((𝐽 qTop 𝐹) ∈ (TopOn‘𝑌) → (𝐽 qTop 𝐹) ∈ Top)
3		eqid 2765	. . . 4 ⊢ ∪ (𝐽 qTop 𝐹) = ∪ (𝐽 qTop 𝐹)
4	3	iscld 23236	. . 3 ⊢ ((𝐽 qTop 𝐹) ∈ Top → (𝐴 ∈ (Clsd‘(𝐽 qTop 𝐹)) ↔ (𝐴 ⊆ ∪ (𝐽 qTop 𝐹) ∧ (∪ (𝐽 qTop 𝐹) ∖ 𝐴) ∈ (𝐽 qTop 𝐹))))
5	1, 2, 4	3syl 19	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋–onto→𝑌) → (𝐴 ∈ (Clsd‘(𝐽 qTop 𝐹)) ↔ (𝐴 ⊆ ∪ (𝐽 qTop 𝐹) ∧ (∪ (𝐽 qTop 𝐹) ∖ 𝐴) ∈ (𝐽 qTop 𝐹))))
6		toponuni 23123	. . . . 5 ⊢ ((𝐽 qTop 𝐹) ∈ (TopOn‘𝑌) → 𝑌 = ∪ (𝐽 qTop 𝐹))
7	1, 6	syl 18	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋–onto→𝑌) → 𝑌 = ∪ (𝐽 qTop 𝐹))
8	7	sseq2d 3970	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋–onto→𝑌) → (𝐴 ⊆ 𝑌 ↔ 𝐴 ⊆ ∪ (𝐽 qTop 𝐹)))
9	7	difeq1d 4080	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋–onto→𝑌) → (𝑌 ∖ 𝐴) = (∪ (𝐽 qTop 𝐹) ∖ 𝐴))
10	9	eleq1d 2850	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋–onto→𝑌) → ((𝑌 ∖ 𝐴) ∈ (𝐽 qTop 𝐹) ↔ (∪ (𝐽 qTop 𝐹) ∖ 𝐴) ∈ (𝐽 qTop 𝐹)))
11	8, 10	anbi12d 644	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋–onto→𝑌) → ((𝐴 ⊆ 𝑌 ∧ (𝑌 ∖ 𝐴) ∈ (𝐽 qTop 𝐹)) ↔ (𝐴 ⊆ ∪ (𝐽 qTop 𝐹) ∧ (∪ (𝐽 qTop 𝐹) ∖ 𝐴) ∈ (𝐽 qTop 𝐹))))
12		elqtop3 23913	. . . . 5 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋–onto→𝑌) → ((𝑌 ∖ 𝐴) ∈ (𝐽 qTop 𝐹) ↔ ((𝑌 ∖ 𝐴) ⊆ 𝑌 ∧ (◡𝐹 “ (𝑌 ∖ 𝐴)) ∈ 𝐽)))
13	12	adantr 486	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋–onto→𝑌) ∧ 𝐴 ⊆ 𝑌) → ((𝑌 ∖ 𝐴) ∈ (𝐽 qTop 𝐹) ↔ ((𝑌 ∖ 𝐴) ⊆ 𝑌 ∧ (◡𝐹 “ (𝑌 ∖ 𝐴)) ∈ 𝐽)))
14		difss 4090	. . . . . 6 ⊢ (𝑌 ∖ 𝐴) ⊆ 𝑌
15	14	biantrur 540	. . . . 5 ⊢ ((◡𝐹 “ (𝑌 ∖ 𝐴)) ∈ 𝐽 ↔ ((𝑌 ∖ 𝐴) ⊆ 𝑌 ∧ (◡𝐹 “ (𝑌 ∖ 𝐴)) ∈ 𝐽))
16		fofun 6797	. . . . . . . . . 10 ⊢ (𝐹:𝑋–onto→𝑌 → Fun 𝐹)
17	16	ad2antlr 740	. . . . . . . . 9 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋–onto→𝑌) ∧ 𝐴 ⊆ 𝑌) → Fun 𝐹)
18		funcnvcnv 6607	. . . . . . . . 9 ⊢ (Fun 𝐹 → Fun ◡◡𝐹)
19		imadif 6624	. . . . . . . . 9 ⊢ (Fun ◡◡𝐹 → (◡𝐹 “ (𝑌 ∖ 𝐴)) = ((◡𝐹 “ 𝑌) ∖ (◡𝐹 “ 𝐴)))
20	17, 18, 19	3syl 19	. . . . . . . 8 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋–onto→𝑌) ∧ 𝐴 ⊆ 𝑌) → (◡𝐹 “ (𝑌 ∖ 𝐴)) = ((◡𝐹 “ 𝑌) ∖ (◡𝐹 “ 𝐴)))
21		fof 6796	. . . . . . . . . . . 12 ⊢ (𝐹:𝑋–onto→𝑌 → 𝐹:𝑋⟶𝑌)
22		fimacnv 6732	. . . . . . . . . . . 12 ⊢ (𝐹:𝑋⟶𝑌 → (◡𝐹 “ 𝑌) = 𝑋)
23	21, 22	syl 18	. . . . . . . . . . 11 ⊢ (𝐹:𝑋–onto→𝑌 → (◡𝐹 “ 𝑌) = 𝑋)
24	23	ad2antlr 740	. . . . . . . . . 10 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋–onto→𝑌) ∧ 𝐴 ⊆ 𝑌) → (◡𝐹 “ 𝑌) = 𝑋)
25		toponuni 23123	. . . . . . . . . . 11 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝐽)
26	25	ad2antrr 739	. . . . . . . . . 10 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋–onto→𝑌) ∧ 𝐴 ⊆ 𝑌) → 𝑋 = ∪ 𝐽)
27	24, 26	eqtrd 2800	. . . . . . . . 9 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋–onto→𝑌) ∧ 𝐴 ⊆ 𝑌) → (◡𝐹 “ 𝑌) = ∪ 𝐽)
28	27	difeq1d 4080	. . . . . . . 8 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋–onto→𝑌) ∧ 𝐴 ⊆ 𝑌) → ((◡𝐹 “ 𝑌) ∖ (◡𝐹 “ 𝐴)) = (∪ 𝐽 ∖ (◡𝐹 “ 𝐴)))
29	20, 28	eqtrd 2800	. . . . . . 7 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋–onto→𝑌) ∧ 𝐴 ⊆ 𝑌) → (◡𝐹 “ (𝑌 ∖ 𝐴)) = (∪ 𝐽 ∖ (◡𝐹 “ 𝐴)))
30	29	eleq1d 2850	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋–onto→𝑌) ∧ 𝐴 ⊆ 𝑌) → ((◡𝐹 “ (𝑌 ∖ 𝐴)) ∈ 𝐽 ↔ (∪ 𝐽 ∖ (◡𝐹 “ 𝐴)) ∈ 𝐽))
31		topontop 23122	. . . . . . . 8 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
32	31	ad2antrr 739	. . . . . . 7 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋–onto→𝑌) ∧ 𝐴 ⊆ 𝑌) → 𝐽 ∈ Top)
33		cnvimass 6086	. . . . . . . . 9 ⊢ (◡𝐹 “ 𝐴) ⊆ dom 𝐹
34		fofn 6798	. . . . . . . . . . 11 ⊢ (𝐹:𝑋–onto→𝑌 → 𝐹 Fn 𝑋)
35	34	fndmd 6644	. . . . . . . . . 10 ⊢ (𝐹:𝑋–onto→𝑌 → dom 𝐹 = 𝑋)
36	35	ad2antlr 740	. . . . . . . . 9 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋–onto→𝑌) ∧ 𝐴 ⊆ 𝑌) → dom 𝐹 = 𝑋)
37	33, 36	sseqtrid 3980	. . . . . . . 8 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋–onto→𝑌) ∧ 𝐴 ⊆ 𝑌) → (◡𝐹 “ 𝐴) ⊆ 𝑋)
38	37, 26	sseqtrd 3974	. . . . . . 7 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋–onto→𝑌) ∧ 𝐴 ⊆ 𝑌) → (◡𝐹 “ 𝐴) ⊆ ∪ 𝐽)
39		eqid 2765	. . . . . . . 8 ⊢ ∪ 𝐽 = ∪ 𝐽
40	39	iscld2 23237	. . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ (◡𝐹 “ 𝐴) ⊆ ∪ 𝐽) → ((◡𝐹 “ 𝐴) ∈ (Clsd‘𝐽) ↔ (∪ 𝐽 ∖ (◡𝐹 “ 𝐴)) ∈ 𝐽))
41	32, 38, 40	syl2anc 596	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋–onto→𝑌) ∧ 𝐴 ⊆ 𝑌) → ((◡𝐹 “ 𝐴) ∈ (Clsd‘𝐽) ↔ (∪ 𝐽 ∖ (◡𝐹 “ 𝐴)) ∈ 𝐽))
42	30, 41	bitr4d 285	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋–onto→𝑌) ∧ 𝐴 ⊆ 𝑌) → ((◡𝐹 “ (𝑌 ∖ 𝐴)) ∈ 𝐽 ↔ (◡𝐹 “ 𝐴) ∈ (Clsd‘𝐽)))
43	15, 42	bitr3id 288	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋–onto→𝑌) ∧ 𝐴 ⊆ 𝑌) → (((𝑌 ∖ 𝐴) ⊆ 𝑌 ∧ (◡𝐹 “ (𝑌 ∖ 𝐴)) ∈ 𝐽) ↔ (◡𝐹 “ 𝐴) ∈ (Clsd‘𝐽)))
44	13, 43	bitrd 282	. . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋–onto→𝑌) ∧ 𝐴 ⊆ 𝑌) → ((𝑌 ∖ 𝐴) ∈ (𝐽 qTop 𝐹) ↔ (◡𝐹 “ 𝐴) ∈ (Clsd‘𝐽)))
45	44	pm5.32da 590	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋–onto→𝑌) → ((𝐴 ⊆ 𝑌 ∧ (𝑌 ∖ 𝐴) ∈ (𝐽 qTop 𝐹)) ↔ (𝐴 ⊆ 𝑌 ∧ (◡𝐹 “ 𝐴) ∈ (Clsd‘𝐽))))
46	5, 11, 45	3bitr2d 310	1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹:𝑋–onto→𝑌) → (𝐴 ∈ (Clsd‘(𝐽 qTop 𝐹)) ↔ (𝐴 ⊆ 𝑌 ∧ (◡𝐹 “ 𝐴) ∈ (Clsd‘𝐽))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2146   ∖ cdif 3903   ⊆ wss 3906  ∪ cuni 4874  ^◡ccnv 5662  dom cdm 5663   “ cima 5666  Fun wfun 6534  ⟶wf 6536  –onto→wfo 6538  ‘cfv 6540  (class class class)co 7419   qTop cqtop 17581  Topctop 23102  TopOnctopon 23119  Clsdccld 23225

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7422  df-oprab 7423  df-mpo 7424  df-qtop 17585  df-top 23103  df-topon 23120  df-cld 23228

This theorem is used by:  qtoprest  23927  kqcld  23945  qustgphaus  24333  qtopt1  34291