Theorem qtopss 24089

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 24079, 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 23300	. . . . 5 ⊢ ((𝐾 ∈ (TopOn‘𝑌) ∧ 𝑥 ∈ 𝐾) → 𝑥 ⊆ 𝑌)
2	1	3ad2antl2 1205	. . . 4 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥 ∈ 𝐾) → 𝑥 ⊆ 𝑌)
3		cnima 23638	. . . . 5 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑥 ∈ 𝐾) → (◡𝐹 “ 𝑥) ∈ 𝐽)
4	3	3ad2antl1 1204	. . . 4 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥 ∈ 𝐾) → (◡𝐹 “ 𝑥) ∈ 𝐽)
5		simpl1 1210	. . . . . . 7 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥 ∈ 𝐾) → 𝐹 ∈ (𝐽 Cn 𝐾))
6		cntop1 23613	. . . . . . 7 ⊢ (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐽 ∈ Top)
7	5, 6	syl 18	. . . . . 6 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥 ∈ 𝐾) → 𝐽 ∈ Top)
8		toptopon2 23291	. . . . . 6 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘∪ 𝐽))
9	7, 8	sylib 221	. . . . 5 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥 ∈ 𝐾) → 𝐽 ∈ (TopOn‘∪ 𝐽))
10		simpl2 1211	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥 ∈ 𝐾) → 𝐾 ∈ (TopOn‘𝑌))
11		cnf2 23622	. . . . . . . 8 ⊢ ((𝐽 ∈ (TopOn‘∪ 𝐽) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹:∪ 𝐽⟶𝑌)
12	9, 10, 5, 11	syl3anc 1399	. . . . . . 7 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥 ∈ 𝐾) → 𝐹:∪ 𝐽⟶𝑌)
13	12	ffnd 6740	. . . . . 6 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥 ∈ 𝐾) → 𝐹 Fn ∪ 𝐽)
14		simpl3 1212	. . . . . 6 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥 ∈ 𝐾) → ran 𝐹 = 𝑌)
15		df-fo 6572	. . . . . 6 ⊢ (𝐹:∪ 𝐽⟶onto𝑌 ↔ (𝐹 Fn ∪ 𝐽 ∧ ran 𝐹 = 𝑌))
16	13, 14, 15	sylanbrc 595	. . . . 5 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥 ∈ 𝐾) → 𝐹:∪ 𝐽⟶onto𝑌)
17		elqtop3 24077	. . . . 5 ⊢ ((𝐽 ∈ (TopOn‘∪ 𝐽) ∧ 𝐹:∪ 𝐽⟶onto𝑌) → (𝑥 ∈ (𝐽 qTop 𝐹) ↔ (𝑥 ⊆ 𝑌 ∧ (◡𝐹 “ 𝑥) ∈ 𝐽)))
18	9, 16, 17	syl2anc 596	. . . 4 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥 ∈ 𝐾) → (𝑥 ∈ (𝐽 qTop 𝐹) ↔ (𝑥 ⊆ 𝑌 ∧ (◡𝐹 “ 𝑥) ∈ 𝐽)))
19	2, 4, 18	mpbir2and 726	. . 3 ⊢ (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥 ∈ 𝐾) → 𝑥 ∈ (𝐽 qTop 𝐹))
20	19	ex 418	. 2 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) → (𝑥 ∈ 𝐾 → 𝑥 ∈ (𝐽 qTop 𝐹)))
21	20	ssrdv 3919	1 ⊢ ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) → 𝐾 ⊆ (𝐽 qTop 𝐹))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ⊆ wss 3900  ∪ cuni 4872  ^◡ccnv 5657  ran crn 5659   “ cima 5661   Fn wfn 6561  ⟶wf 6562  ⟶ontowfo 6564  ‘cfv 6566  (class class class)co 7451   qTop cqtop 17725  Topctop 23266  TopOnctopon 23283   Cn ccn 23597

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-map 8887  df-qtop 17729  df-top 23267  df-topon 23284  df-cn 23600

This theorem is used by:  qtoprest  24091  qtopomap  24092  qtopcmap  24093