Theorem qtopcmap 22324

Description: If 𝐹 is a surjective continuous closed map, then it is a quotient map. (A closed map is a function that maps closed sets to closed sets.) (Contributed by Mario Carneiro, 24-Mar-2015.)

Hypotheses

Ref	Expression
qtopomap.4	⊢ (𝜑 → 𝐾 ∈ (TopOn‘𝑌))
qtopomap.5	⊢ (𝜑 → 𝐹 ∈ (𝐽 Cn 𝐾))
qtopomap.6	⊢ (𝜑 → ran 𝐹 = 𝑌)
qtopcmap.7	⊢ ((𝜑 ∧ 𝑥 ∈ (Clsd‘𝐽)) → (𝐹 “ 𝑥) ∈ (Clsd‘𝐾))

Assertion

Ref	Expression
qtopcmap	⊢ (𝜑 → 𝐾 = (𝐽 qTop 𝐹))

Distinct variable groups:   𝑥,𝐹   𝑥,𝐽   𝑥,𝐾   𝜑,𝑥   𝑥,𝑌

Proof of Theorem qtopcmap

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		qtopomap.5	. . 3 ⊢ (𝜑 → 𝐹 ∈ (𝐽 Cn 𝐾))
2		qtopomap.4	. . 3 ⊢ (𝜑 → 𝐾 ∈ (TopOn‘𝑌))
3		qtopomap.6	. . 3 ⊢ (𝜑 → ran 𝐹 = 𝑌)
4		qtopss 22320	. . 3 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) → 𝐾 ⊆ (𝐽 qTop 𝐹))
5	1, 2, 3, 4	syl3anc 1368	. 2 ⊢ (𝜑 → 𝐾 ⊆ (𝐽 qTop 𝐹))
6		cntop1 21845	. . . . . 6 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐽 ∈ Top)
7	1, 6	syl 17	. . . . 5 ⊢ (𝜑 → 𝐽 ∈ Top)
8		toptopon2 21523	. . . . . . . . 9 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘∪ 𝐽))
9	7, 8	sylib 221	. . . . . . . 8 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘∪ 𝐽))
10		cnf2 21854	. . . . . . . 8 ⊢ ((𝐽 ∈ (TopOn‘∪ 𝐽) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹:∪ 𝐽⟶𝑌)
11	9, 2, 1, 10	syl3anc 1368	. . . . . . 7 ⊢ (𝜑 → 𝐹:∪ 𝐽⟶𝑌)
12	11	ffnd 6488	. . . . . 6 ⊢ (𝜑 → 𝐹 Fn ∪ 𝐽)
13		df-fo 6330	. . . . . 6 ⊢ (𝐹:∪ 𝐽–onto→𝑌 ↔ (𝐹 Fn ∪ 𝐽 ∧ ran 𝐹 = 𝑌))
14	12, 3, 13	sylanbrc 586	. . . . 5 ⊢ (𝜑 → 𝐹:∪ 𝐽–onto→𝑌)
15		eqid 2798	. . . . . 6 ⊢ ∪ 𝐽 = ∪ 𝐽
16	15	elqtop2 22306	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝐹:∪ 𝐽–onto→𝑌) → (𝑦 ∈ (𝐽 qTop 𝐹) ↔ (𝑦 ⊆ 𝑌 ∧ (◡𝐹 “ 𝑦) ∈ 𝐽)))
17	7, 14, 16	syl2anc 587	. . . 4 ⊢ (𝜑 → (𝑦 ∈ (𝐽 qTop 𝐹) ↔ (𝑦 ⊆ 𝑌 ∧ (◡𝐹 “ 𝑦) ∈ 𝐽)))
18	14	adantr 484	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝑌 ∧ (◡𝐹 “ 𝑦) ∈ 𝐽)) → 𝐹:∪ 𝐽–onto→𝑌)
19		difss 4059	. . . . . . . . 9 ⊢ (𝑌 ∖ 𝑦) ⊆ 𝑌
20		foimacnv 6607	. . . . . . . . 9 ⊢ ((𝐹:∪ 𝐽–onto→𝑌 ∧ (𝑌 ∖ 𝑦) ⊆ 𝑌) → (𝐹 “ (◡𝐹 “ (𝑌 ∖ 𝑦))) = (𝑌 ∖ 𝑦))
21	18, 19, 20	sylancl 589	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝑌 ∧ (◡𝐹 “ 𝑦) ∈ 𝐽)) → (𝐹 “ (◡𝐹 “ (𝑌 ∖ 𝑦))) = (𝑌 ∖ 𝑦))
22	2	adantr 484	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝑌 ∧ (◡𝐹 “ 𝑦) ∈ 𝐽)) → 𝐾 ∈ (TopOn‘𝑌))
23		toponuni 21519	. . . . . . . . . 10 ⊢ (𝐾 ∈ (TopOn‘𝑌) → 𝑌 = ∪ 𝐾)
24	22, 23	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝑌 ∧ (◡𝐹 “ 𝑦) ∈ 𝐽)) → 𝑌 = ∪ 𝐾)
25	24	difeq1d 4049	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝑌 ∧ (◡𝐹 “ 𝑦) ∈ 𝐽)) → (𝑌 ∖ 𝑦) = (∪ 𝐾 ∖ 𝑦))
26	21, 25	eqtrd 2833	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝑌 ∧ (◡𝐹 “ 𝑦) ∈ 𝐽)) → (𝐹 “ (◡𝐹 “ (𝑌 ∖ 𝑦))) = (∪ 𝐾 ∖ 𝑦))
27		imaeq2 5892	. . . . . . . . 9 ⊢ (𝑥 = (◡𝐹 “ (𝑌 ∖ 𝑦)) → (𝐹 “ 𝑥) = (𝐹 “ (◡𝐹 “ (𝑌 ∖ 𝑦))))
28	27	eleq1d 2874	. . . . . . . 8 ⊢ (𝑥 = (◡𝐹 “ (𝑌 ∖ 𝑦)) → ((𝐹 “ 𝑥) ∈ (Clsd‘𝐾) ↔ (𝐹 “ (◡𝐹 “ (𝑌 ∖ 𝑦))) ∈ (Clsd‘𝐾)))
29		qtopcmap.7	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (Clsd‘𝐽)) → (𝐹 “ 𝑥) ∈ (Clsd‘𝐾))
30	29	ralrimiva 3149	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑥 ∈ (Clsd‘𝐽)(𝐹 “ 𝑥) ∈ (Clsd‘𝐾))
31	30	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝑌 ∧ (◡𝐹 “ 𝑦) ∈ 𝐽)) → ∀𝑥 ∈ (Clsd‘𝐽)(𝐹 “ 𝑥) ∈ (Clsd‘𝐾))
32		fofun 6566	. . . . . . . . . . 11 ⊢ (𝐹:∪ 𝐽–onto→𝑌 → Fun 𝐹)
33		funcnvcnv 6391	. . . . . . . . . . 11 ⊢ (Fun 𝐹 → Fun ◡◡𝐹)
34		imadif 6408	. . . . . . . . . . 11 ⊢ (Fun ◡◡𝐹 → (◡𝐹 “ (𝑌 ∖ 𝑦)) = ((◡𝐹 “ 𝑌) ∖ (◡𝐹 “ 𝑦)))
35	18, 32, 33, 34	4syl 19	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝑌 ∧ (◡𝐹 “ 𝑦) ∈ 𝐽)) → (◡𝐹 “ (𝑌 ∖ 𝑦)) = ((◡𝐹 “ 𝑌) ∖ (◡𝐹 “ 𝑦)))
36	11	adantr 484	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝑌 ∧ (◡𝐹 “ 𝑦) ∈ 𝐽)) → 𝐹:∪ 𝐽⟶𝑌)
37		fimacnv 6816	. . . . . . . . . . . 12 ⊢ (𝐹:∪ 𝐽⟶𝑌 → (◡𝐹 “ 𝑌) = ∪ 𝐽)
38	36, 37	syl 17	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝑌 ∧ (◡𝐹 “ 𝑦) ∈ 𝐽)) → (◡𝐹 “ 𝑌) = ∪ 𝐽)
39	38	difeq1d 4049	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝑌 ∧ (◡𝐹 “ 𝑦) ∈ 𝐽)) → ((◡𝐹 “ 𝑌) ∖ (◡𝐹 “ 𝑦)) = (∪ 𝐽 ∖ (◡𝐹 “ 𝑦)))
40	35, 39	eqtrd 2833	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝑌 ∧ (◡𝐹 “ 𝑦) ∈ 𝐽)) → (◡𝐹 “ (𝑌 ∖ 𝑦)) = (∪ 𝐽 ∖ (◡𝐹 “ 𝑦)))
41	7	adantr 484	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝑌 ∧ (◡𝐹 “ 𝑦) ∈ 𝐽)) → 𝐽 ∈ Top)
42		simprr 772	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝑌 ∧ (◡𝐹 “ 𝑦) ∈ 𝐽)) → (◡𝐹 “ 𝑦) ∈ 𝐽)
43	15	opncld 21638	. . . . . . . . . 10 ⊢ ((𝐽 ∈ Top ∧ (◡𝐹 “ 𝑦) ∈ 𝐽) → (∪ 𝐽 ∖ (◡𝐹 “ 𝑦)) ∈ (Clsd‘𝐽))
44	41, 42, 43	syl2anc 587	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝑌 ∧ (◡𝐹 “ 𝑦) ∈ 𝐽)) → (∪ 𝐽 ∖ (◡𝐹 “ 𝑦)) ∈ (Clsd‘𝐽))
45	40, 44	eqeltrd 2890	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝑌 ∧ (◡𝐹 “ 𝑦) ∈ 𝐽)) → (◡𝐹 “ (𝑌 ∖ 𝑦)) ∈ (Clsd‘𝐽))
46	28, 31, 45	rspcdva 3573	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝑌 ∧ (◡𝐹 “ 𝑦) ∈ 𝐽)) → (𝐹 “ (◡𝐹 “ (𝑌 ∖ 𝑦))) ∈ (Clsd‘𝐾))
47	26, 46	eqeltrrd 2891	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝑌 ∧ (◡𝐹 “ 𝑦) ∈ 𝐽)) → (∪ 𝐾 ∖ 𝑦) ∈ (Clsd‘𝐾))
48		topontop 21518	. . . . . . . 8 ⊢ (𝐾 ∈ (TopOn‘𝑌) → 𝐾 ∈ Top)
49	22, 48	syl 17	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝑌 ∧ (◡𝐹 “ 𝑦) ∈ 𝐽)) → 𝐾 ∈ Top)
50		simprl 770	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝑌 ∧ (◡𝐹 “ 𝑦) ∈ 𝐽)) → 𝑦 ⊆ 𝑌)
51	50, 24	sseqtrd 3955	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝑌 ∧ (◡𝐹 “ 𝑦) ∈ 𝐽)) → 𝑦 ⊆ ∪ 𝐾)
52		eqid 2798	. . . . . . . 8 ⊢ ∪ 𝐾 = ∪ 𝐾
53	52	isopn2 21637	. . . . . . 7 ⊢ ((𝐾 ∈ Top ∧ 𝑦 ⊆ ∪ 𝐾) → (𝑦 ∈ 𝐾 ↔ (∪ 𝐾 ∖ 𝑦) ∈ (Clsd‘𝐾)))
54	49, 51, 53	syl2anc 587	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝑌 ∧ (◡𝐹 “ 𝑦) ∈ 𝐽)) → (𝑦 ∈ 𝐾 ↔ (∪ 𝐾 ∖ 𝑦) ∈ (Clsd‘𝐾)))
55	47, 54	mpbird 260	. . . . 5 ⊢ ((𝜑 ∧ (𝑦 ⊆ 𝑌 ∧ (◡𝐹 “ 𝑦) ∈ 𝐽)) → 𝑦 ∈ 𝐾)
56	55	ex 416	. . . 4 ⊢ (𝜑 → ((𝑦 ⊆ 𝑌 ∧ (◡𝐹 “ 𝑦) ∈ 𝐽) → 𝑦 ∈ 𝐾))
57	17, 56	sylbid 243	. . 3 ⊢ (𝜑 → (𝑦 ∈ (𝐽 qTop 𝐹) → 𝑦 ∈ 𝐾))
58	57	ssrdv 3921	. 2 ⊢ (𝜑 → (𝐽 qTop 𝐹) ⊆ 𝐾)
59	5, 58	eqssd 3932	1 ⊢ (𝜑 → 𝐾 = (𝐽 qTop 𝐹))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1538   ∈ wcel 2111  ∀wral 3106   ∖ cdif 3878   ⊆ wss 3881  ∪ cuni 4800  ^◡ccnv 5518  ran crn 5520   “ cima 5522  Fun wfun 6318   Fn wfn 6319  ⟶wf 6320  –onto→wfo 6322  ‘cfv 6324  (class class class)co 7135   qTop cqtop 16768  Topctop 21498  TopOnctopon 21515  Clsdccld 21621   Cn ccn 21829

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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-ov 7138  df-oprab 7139  df-mpo 7140  df-map 8391  df-qtop 16772  df-top 21499  df-topon 21516  df-cld 21624  df-cn 21832

This theorem is referenced by: (None)