Theorem qtopss 23872

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 23862, 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 23084	. . . . 5 ⊢ ((𝐾 ∈ (TopOn‘𝑌) ∧ 𝑥 ∈ 𝐾) → 𝑥 ⊆ 𝑌)
2	1	3ad2antl2 1205	. . . 4 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥 ∈ 𝐾) → 𝑥 ⊆ 𝑌)
3		cnima 23422	. . . . 5 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑥 ∈ 𝐾) → (◡𝐹 “ 𝑥) ∈ 𝐽)
4	3	3ad2antl1 1204	. . . 4 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥 ∈ 𝐾) → (◡𝐹 “ 𝑥) ∈ 𝐽)
5		simpl1 1210	. . . . . . 7 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥 ∈ 𝐾) → 𝐹 ∈ (𝐽 Cn 𝐾))
6		cntop1 23397	. . . . . . 7 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐽 ∈ Top)
7	5, 6	syl 18	. . . . . 6 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥 ∈ 𝐾) → 𝐽 ∈ Top)
8		toptopon2 23075	. . . . . 6 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘∪ 𝐽))
9	7, 8	sylib 221	. . . . 5 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥 ∈ 𝐾) → 𝐽 ∈ (TopOn‘∪ 𝐽))
10		simpl2 1211	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥 ∈ 𝐾) → 𝐾 ∈ (TopOn‘𝑌))
11		cnf2 23406	. . . . . . . 8 ⊢ ((𝐽 ∈ (TopOn‘∪ 𝐽) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹:∪ 𝐽⟶𝑌)
12	9, 10, 5, 11	syl3anc 1398	. . . . . . 7 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥 ∈ 𝐾) → 𝐹:∪ 𝐽⟶𝑌)
13	12	ffnd 6706	. . . . . 6 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥 ∈ 𝐾) → 𝐹 Fn ∪ 𝐽)
14		simpl3 1212	. . . . . 6 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥 ∈ 𝐾) → ran 𝐹 = 𝑌)
15		df-fo 6542	. . . . . 6 ⊢ (𝐹:∪ 𝐽–onto→𝑌 ↔ (𝐹 Fn ∪ 𝐽 ∧ ran 𝐹 = 𝑌))
16	13, 14, 15	sylanbrc 594	. . . . 5 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥 ∈ 𝐾) → 𝐹:∪ 𝐽–onto→𝑌)
17		elqtop3 23860	. . . . 5 ⊢ ((𝐽 ∈ (TopOn‘∪ 𝐽) ∧ 𝐹:∪ 𝐽–onto→𝑌) → (𝑥 ∈ (𝐽 qTop 𝐹) ↔ (𝑥 ⊆ 𝑌 ∧ (◡𝐹 “ 𝑥) ∈ 𝐽)))
18	9, 16, 17	syl2anc 595	. . . 4 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥 ∈ 𝐾) → (𝑥 ∈ (𝐽 qTop 𝐹) ↔ (𝑥 ⊆ 𝑌 ∧ (◡𝐹 “ 𝑥) ∈ 𝐽)))
19	2, 4, 18	mpbir2and 725	. . 3 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥 ∈ 𝐾) → 𝑥 ∈ (𝐽 qTop 𝐹))
20	19	ex 417	. 2 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) → (𝑥 ∈ 𝐾 → 𝑥 ∈ (𝐽 qTop 𝐹)))
21	20	ssrdv 3943	1 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) → 𝐾 ⊆ (𝐽 qTop 𝐹))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1103   = wceq 1570   ∈ wcel 2143   ⊆ wss 3905  ∪ cuni 4872  ^◡ccnv 5660  ran crn 5662   “ cima 5664   Fn wfn 6531  ⟶wf 6532  –onto→wfo 6534  ‘cfv 6536  (class class class)co 7410   qTop cqtop 17552  Topctop 23050  TopOnctopon 23067   Cn ccn 23381

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-map 8822  df-qtop 17556  df-top 23051  df-topon 23068  df-cn 23384

This theorem is referenced by:  qtoprest  23874  qtopomap  23875  qtopcmap  23876