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

Theorem qtopss 19951
Description: A surjective continuous function from  J to  K induces a topology  J qTop  F on the base set of  K. This topology is in general finer than  K. Together with qtopid 19941, this implies that  J qTop  F is the finest topology making  F continuous, i.e. the final topology with respect to the family  { F }. (Contributed by Mario Carneiro, 24-Mar-2015.)
Assertion
Ref Expression
qtopss  |-  ( ( F  e.  ( J  Cn  K )  /\  K  e.  (TopOn `  Y
)  /\  ran  F  =  Y )  ->  K  C_  ( J qTop  F ) )

Proof of Theorem qtopss
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 toponss 19197 . . . . 5  |-  ( ( K  e.  (TopOn `  Y )  /\  x  e.  K )  ->  x  C_  Y )
213ad2antl2 1159 . . . 4  |-  ( ( ( F  e.  ( J  Cn  K )  /\  K  e.  (TopOn `  Y )  /\  ran  F  =  Y )  /\  x  e.  K )  ->  x  C_  Y )
3 cnima 19532 . . . . 5  |-  ( ( F  e.  ( J  Cn  K )  /\  x  e.  K )  ->  ( `' F "
x )  e.  J
)
433ad2antl1 1158 . . . 4  |-  ( ( ( F  e.  ( J  Cn  K )  /\  K  e.  (TopOn `  Y )  /\  ran  F  =  Y )  /\  x  e.  K )  ->  ( `' F "
x )  e.  J
)
5 simpl1 999 . . . . . . 7  |-  ( ( ( F  e.  ( J  Cn  K )  /\  K  e.  (TopOn `  Y )  /\  ran  F  =  Y )  /\  x  e.  K )  ->  F  e.  ( J  Cn  K ) )
6 cntop1 19507 . . . . . . 7  |-  ( F  e.  ( J  Cn  K )  ->  J  e.  Top )
75, 6syl 16 . . . . . 6  |-  ( ( ( F  e.  ( J  Cn  K )  /\  K  e.  (TopOn `  Y )  /\  ran  F  =  Y )  /\  x  e.  K )  ->  J  e.  Top )
8 eqid 2467 . . . . . . 7  |-  U. J  =  U. J
98toptopon 19201 . . . . . 6  |-  ( J  e.  Top  <->  J  e.  (TopOn `  U. J ) )
107, 9sylib 196 . . . . 5  |-  ( ( ( F  e.  ( J  Cn  K )  /\  K  e.  (TopOn `  Y )  /\  ran  F  =  Y )  /\  x  e.  K )  ->  J  e.  (TopOn `  U. J ) )
11 simpl2 1000 . . . . . . . 8  |-  ( ( ( F  e.  ( J  Cn  K )  /\  K  e.  (TopOn `  Y )  /\  ran  F  =  Y )  /\  x  e.  K )  ->  K  e.  (TopOn `  Y ) )
12 cnf2 19516 . . . . . . . 8  |-  ( ( J  e.  (TopOn `  U. J )  /\  K  e.  (TopOn `  Y )  /\  F  e.  ( J  Cn  K ) )  ->  F : U. J
--> Y )
1310, 11, 5, 12syl3anc 1228 . . . . . . 7  |-  ( ( ( F  e.  ( J  Cn  K )  /\  K  e.  (TopOn `  Y )  /\  ran  F  =  Y )  /\  x  e.  K )  ->  F : U. J --> Y )
14 ffn 5729 . . . . . . 7  |-  ( F : U. J --> Y  ->  F  Fn  U. J )
1513, 14syl 16 . . . . . 6  |-  ( ( ( F  e.  ( J  Cn  K )  /\  K  e.  (TopOn `  Y )  /\  ran  F  =  Y )  /\  x  e.  K )  ->  F  Fn  U. J
)
16 simpl3 1001 . . . . . 6  |-  ( ( ( F  e.  ( J  Cn  K )  /\  K  e.  (TopOn `  Y )  /\  ran  F  =  Y )  /\  x  e.  K )  ->  ran  F  =  Y )
17 df-fo 5592 . . . . . 6  |-  ( F : U. J -onto-> Y  <->  ( F  Fn  U. J  /\  ran  F  =  Y ) )
1815, 16, 17sylanbrc 664 . . . . 5  |-  ( ( ( F  e.  ( J  Cn  K )  /\  K  e.  (TopOn `  Y )  /\  ran  F  =  Y )  /\  x  e.  K )  ->  F : U. J -onto-> Y )
19 elqtop3 19939 . . . . 5  |-  ( ( J  e.  (TopOn `  U. J )  /\  F : U. J -onto-> Y )  ->  ( x  e.  ( J qTop  F )  <-> 
( x  C_  Y  /\  ( `' F "
x )  e.  J
) ) )
2010, 18, 19syl2anc 661 . . . 4  |-  ( ( ( F  e.  ( J  Cn  K )  /\  K  e.  (TopOn `  Y )  /\  ran  F  =  Y )  /\  x  e.  K )  ->  ( x  e.  ( J qTop  F )  <->  ( x  C_  Y  /\  ( `' F " x )  e.  J ) ) )
212, 4, 20mpbir2and 920 . . 3  |-  ( ( ( F  e.  ( J  Cn  K )  /\  K  e.  (TopOn `  Y )  /\  ran  F  =  Y )  /\  x  e.  K )  ->  x  e.  ( J qTop 
F ) )
2221ex 434 . 2  |-  ( ( F  e.  ( J  Cn  K )  /\  K  e.  (TopOn `  Y
)  /\  ran  F  =  Y )  ->  (
x  e.  K  ->  x  e.  ( J qTop  F ) ) )
2322ssrdv 3510 1  |-  ( ( F  e.  ( J  Cn  K )  /\  K  e.  (TopOn `  Y
)  /\  ran  F  =  Y )  ->  K  C_  ( J qTop  F ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    /\ wa 369    /\ w3a 973    = wceq 1379    e. wcel 1767    C_ wss 3476   U.cuni 4245   `'ccnv 4998   ran crn 5000   "cima 5002    Fn wfn 5581   -->wf 5582   -onto->wfo 5584   ` cfv 5586  (class class class)co 6282   qTop cqtop 14754   Topctop 19161  TopOnctopon 19162    Cn ccn 19491
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1601  ax-4 1612  ax-5 1680  ax-6 1719  ax-7 1739  ax-8 1769  ax-9 1771  ax-10 1786  ax-11 1791  ax-12 1803  ax-13 1968  ax-ext 2445  ax-rep 4558  ax-sep 4568  ax-nul 4576  ax-pow 4625  ax-pr 4686  ax-un 6574
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 975  df-tru 1382  df-ex 1597  df-nf 1600  df-sb 1712  df-eu 2279  df-mo 2280  df-clab 2453  df-cleq 2459  df-clel 2462  df-nfc 2617  df-ne 2664  df-ral 2819  df-rex 2820  df-reu 2821  df-rab 2823  df-v 3115  df-sbc 3332  df-csb 3436  df-dif 3479  df-un 3481  df-in 3483  df-ss 3490  df-nul 3786  df-if 3940  df-pw 4012  df-sn 4028  df-pr 4030  df-op 4034  df-uni 4246  df-iun 4327  df-br 4448  df-opab 4506  df-mpt 4507  df-id 4795  df-xp 5005  df-rel 5006  df-cnv 5007  df-co 5008  df-dm 5009  df-rn 5010  df-res 5011  df-ima 5012  df-iota 5549  df-fun 5588  df-fn 5589  df-f 5590  df-f1 5591  df-fo 5592  df-f1o 5593  df-fv 5594  df-ov 6285  df-oprab 6286  df-mpt2 6287  df-map 7419  df-qtop 14758  df-top 19166  df-topon 19169  df-cn 19494
This theorem is referenced by:  qtoprest  19953  qtopomap  19954  qtopcmap  19955
  Copyright terms: Public domain W3C validator