Theorem qtopss 23625

Description: A surjective continuous function from 𝐽 to 𝐾 induces a topology 𝐽 qTop 𝐹 on the base set of 𝐾. This topology is in general finer than 𝐾. Together with qtopid 23615, this implies that 𝐽 qTop 𝐹 is the finest topology making 𝐹 continuous, i.e. the final topology with respect to the family {𝐹}. (Contributed by Mario Carneiro, 24-Mar-2015.)

Assertion

Ref	Expression
qtopss	⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) → 𝐾 ⊆ (𝐽 qTop 𝐹))

Proof of Theorem qtopss

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		toponss 22837	. . . . 5 ⊢ ((𝐾 ∈ (TopOn‘𝑌) ∧ 𝑥 ∈ 𝐾) → 𝑥 ⊆ 𝑌)
2	1	3ad2antl2 1187	. . . 4 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥 ∈ 𝐾) → 𝑥 ⊆ 𝑌)
3		cnima 23175	. . . . 5 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑥 ∈ 𝐾) → (◡𝐹 “ 𝑥) ∈ 𝐽)
4	3	3ad2antl1 1186	. . . 4 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥 ∈ 𝐾) → (◡𝐹 “ 𝑥) ∈ 𝐽)
5		simpl1 1192	. . . . . . 7 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥 ∈ 𝐾) → 𝐹 ∈ (𝐽 Cn 𝐾))
6		cntop1 23150	. . . . . . 7 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐽 ∈ Top)
7	5, 6	syl 17	. . . . . 6 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥 ∈ 𝐾) → 𝐽 ∈ Top)
8		toptopon2 22828	. . . . . 6 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘∪ 𝐽))
9	7, 8	sylib 218	. . . . 5 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥 ∈ 𝐾) → 𝐽 ∈ (TopOn‘∪ 𝐽))
10		simpl2 1193	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥 ∈ 𝐾) → 𝐾 ∈ (TopOn‘𝑌))
11		cnf2 23159	. . . . . . . 8 ⊢ ((𝐽 ∈ (TopOn‘∪ 𝐽) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹:∪ 𝐽⟶𝑌)
12	9, 10, 5, 11	syl3anc 1373	. . . . . . 7 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥 ∈ 𝐾) → 𝐹:∪ 𝐽⟶𝑌)
13	12	ffnd 6647	. . . . . 6 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥 ∈ 𝐾) → 𝐹 Fn ∪ 𝐽)
14		simpl3 1194	. . . . . 6 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥 ∈ 𝐾) → ran 𝐹 = 𝑌)
15		df-fo 6482	. . . . . 6 ⊢ (𝐹:∪ 𝐽–onto→𝑌 ↔ (𝐹 Fn ∪ 𝐽 ∧ ran 𝐹 = 𝑌))
16	13, 14, 15	sylanbrc 583	. . . . 5 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥 ∈ 𝐾) → 𝐹:∪ 𝐽–onto→𝑌)
17		elqtop3 23613	. . . . 5 ⊢ ((𝐽 ∈ (TopOn‘∪ 𝐽) ∧ 𝐹:∪ 𝐽–onto→𝑌) → (𝑥 ∈ (𝐽 qTop 𝐹) ↔ (𝑥 ⊆ 𝑌 ∧ (◡𝐹 “ 𝑥) ∈ 𝐽)))
18	9, 16, 17	syl2anc 584	. . . 4 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥 ∈ 𝐾) → (𝑥 ∈ (𝐽 qTop 𝐹) ↔ (𝑥 ⊆ 𝑌 ∧ (◡𝐹 “ 𝑥) ∈ 𝐽)))
19	2, 4, 18	mpbir2and 713	. . 3 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥 ∈ 𝐾) → 𝑥 ∈ (𝐽 qTop 𝐹))
20	19	ex 412	. 2 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) → (𝑥 ∈ 𝐾 → 𝑥 ∈ (𝐽 qTop 𝐹)))
21	20	ssrdv 3935	1 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) → 𝐾 ⊆ (𝐽 qTop 𝐹))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2111   ⊆ wss 3897  ∪ cuni 4854  ^◡ccnv 5610  ran crn 5612   “ cima 5614   Fn wfn 6471  ⟶wf 6472  –onto→wfo 6474  ‘cfv 6476  (class class class)co 7341   qTop cqtop 17402  Topctop 22803  TopOnctopon 22820   Cn ccn 23134

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5212  ax-sep 5229  ax-nul 5239  ax-pow 5298  ax-pr 5365  ax-un 7663

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3737  df-csb 3846  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-nul 4279  df-if 4471  df-pw 4547  df-sn 4572  df-pr 4574  df-op 4578  df-uni 4855  df-iun 4938  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5506  df-xp 5617  df-rel 5618  df-cnv 5619  df-co 5620  df-dm 5621  df-rn 5622  df-res 5623  df-ima 5624  df-iota 6432  df-fun 6478  df-fn 6479  df-f 6480  df-f1 6481  df-fo 6482  df-f1o 6483  df-fv 6484  df-ov 7344  df-oprab 7345  df-mpo 7346  df-map 8747  df-qtop 17406  df-top 22804  df-topon 22821  df-cn 23137

This theorem is referenced by:  qtoprest  23627  qtopomap  23628  qtopcmap  23629