MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  qtopss Structured version   Visualization version   GIF version

Theorem qtopss 23710
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 23700, 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.
StepHypRef Expression
1 toponss 22920 . . . . 5 ((𝐾 ∈ (TopOn‘𝑌) ∧ 𝑥𝐾) → 𝑥𝑌)
213ad2antl2 1183 . . . 4 (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥𝐾) → 𝑥𝑌)
3 cnima 23260 . . . . 5 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝑥𝐾) → (𝐹𝑥) ∈ 𝐽)
433ad2antl1 1182 . . . 4 (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥𝐾) → (𝐹𝑥) ∈ 𝐽)
5 simpl1 1188 . . . . . . 7 (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥𝐾) → 𝐹 ∈ (𝐽 Cn 𝐾))
6 cntop1 23235 . . . . . . 7 (𝐹 ∈ (𝐽 Cn 𝐾) → 𝐽 ∈ Top)
75, 6syl 17 . . . . . 6 (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥𝐾) → 𝐽 ∈ Top)
8 toptopon2 22911 . . . . . 6 (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘ 𝐽))
97, 8sylib 217 . . . . 5 (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥𝐾) → 𝐽 ∈ (TopOn‘ 𝐽))
10 simpl2 1189 . . . . . . . 8 (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥𝐾) → 𝐾 ∈ (TopOn‘𝑌))
11 cnf2 23244 . . . . . . . 8 ((𝐽 ∈ (TopOn‘ 𝐽) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ 𝐹 ∈ (𝐽 Cn 𝐾)) → 𝐹: 𝐽𝑌)
129, 10, 5, 11syl3anc 1368 . . . . . . 7 (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥𝐾) → 𝐹: 𝐽𝑌)
1312ffnd 6729 . . . . . 6 (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥𝐾) → 𝐹 Fn 𝐽)
14 simpl3 1190 . . . . . 6 (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥𝐾) → ran 𝐹 = 𝑌)
15 df-fo 6560 . . . . . 6 (𝐹: 𝐽onto𝑌 ↔ (𝐹 Fn 𝐽 ∧ ran 𝐹 = 𝑌))
1613, 14, 15sylanbrc 581 . . . . 5 (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥𝐾) → 𝐹: 𝐽onto𝑌)
17 elqtop3 23698 . . . . 5 ((𝐽 ∈ (TopOn‘ 𝐽) ∧ 𝐹: 𝐽onto𝑌) → (𝑥 ∈ (𝐽 qTop 𝐹) ↔ (𝑥𝑌 ∧ (𝐹𝑥) ∈ 𝐽)))
189, 16, 17syl2anc 582 . . . 4 (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥𝐾) → (𝑥 ∈ (𝐽 qTop 𝐹) ↔ (𝑥𝑌 ∧ (𝐹𝑥) ∈ 𝐽)))
192, 4, 18mpbir2and 711 . . 3 (((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) ∧ 𝑥𝐾) → 𝑥 ∈ (𝐽 qTop 𝐹))
2019ex 411 . 2 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) → (𝑥𝐾𝑥 ∈ (𝐽 qTop 𝐹)))
2120ssrdv 3985 1 ((𝐹 ∈ (𝐽 Cn 𝐾) ∧ 𝐾 ∈ (TopOn‘𝑌) ∧ ran 𝐹 = 𝑌) → 𝐾 ⊆ (𝐽 qTop 𝐹))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 394  w3a 1084   = wceq 1534  wcel 2099  wss 3947   cuni 4913  ccnv 5681  ran crn 5683  cima 5685   Fn wfn 6549  wf 6550  ontowfo 6552  cfv 6554  (class class class)co 7424   qTop cqtop 17518  Topctop 22886  TopOnctopon 22903   Cn ccn 23219
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2167  ax-ext 2697  ax-rep 5290  ax-sep 5304  ax-nul 5311  ax-pow 5369  ax-pr 5433  ax-un 7746
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2529  df-eu 2558  df-clab 2704  df-cleq 2718  df-clel 2803  df-nfc 2878  df-ne 2931  df-ral 3052  df-rex 3061  df-reu 3365  df-rab 3420  df-v 3464  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4326  df-if 4534  df-pw 4609  df-sn 4634  df-pr 4636  df-op 4640  df-uni 4914  df-iun 5003  df-br 5154  df-opab 5216  df-mpt 5237  df-id 5580  df-xp 5688  df-rel 5689  df-cnv 5690  df-co 5691  df-dm 5692  df-rn 5693  df-res 5694  df-ima 5695  df-iota 6506  df-fun 6556  df-fn 6557  df-f 6558  df-f1 6559  df-fo 6560  df-f1o 6561  df-fv 6562  df-ov 7427  df-oprab 7428  df-mpo 7429  df-map 8857  df-qtop 17522  df-top 22887  df-topon 22904  df-cn 23222
This theorem is referenced by:  qtoprest  23712  qtopomap  23713  qtopcmap  23714
  Copyright terms: Public domain W3C validator