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

Theorem cnntri 17016
Description: Property of the preimage of an interior. (Contributed by Mario Carneiro, 25-Aug-2015.)
Hypothesis
Ref Expression
cncls2i.1  |-  Y  = 
U. K
Assertion
Ref Expression
cnntri  |-  ( ( F  e.  ( J  Cn  K )  /\  S  C_  Y )  -> 
( `' F "
( ( int `  K
) `  S )
)  C_  ( ( int `  J ) `  ( `' F " S ) ) )

Proof of Theorem cnntri
StepHypRef Expression
1 cntop1 16986 . . 3  |-  ( F  e.  ( J  Cn  K )  ->  J  e.  Top )
21adantr 451 . 2  |-  ( ( F  e.  ( J  Cn  K )  /\  S  C_  Y )  ->  J  e.  Top )
3 cnvimass 5049 . . 3  |-  ( `' F " S ) 
C_  dom  F
4 eqid 2296 . . . . . 6  |-  U. J  =  U. J
5 cncls2i.1 . . . . . 6  |-  Y  = 
U. K
64, 5cnf 16992 . . . . 5  |-  ( F  e.  ( J  Cn  K )  ->  F : U. J --> Y )
7 fdm 5409 . . . . 5  |-  ( F : U. J --> Y  ->  dom  F  =  U. J
)
86, 7syl 15 . . . 4  |-  ( F  e.  ( J  Cn  K )  ->  dom  F  =  U. J )
98adantr 451 . . 3  |-  ( ( F  e.  ( J  Cn  K )  /\  S  C_  Y )  ->  dom  F  =  U. J
)
103, 9syl5sseq 3239 . 2  |-  ( ( F  e.  ( J  Cn  K )  /\  S  C_  Y )  -> 
( `' F " S )  C_  U. J
)
11 cntop2 16987 . . . 4  |-  ( F  e.  ( J  Cn  K )  ->  K  e.  Top )
125ntropn 16802 . . . 4  |-  ( ( K  e.  Top  /\  S  C_  Y )  -> 
( ( int `  K
) `  S )  e.  K )
1311, 12sylan 457 . . 3  |-  ( ( F  e.  ( J  Cn  K )  /\  S  C_  Y )  -> 
( ( int `  K
) `  S )  e.  K )
14 cnima 17010 . . 3  |-  ( ( F  e.  ( J  Cn  K )  /\  ( ( int `  K
) `  S )  e.  K )  ->  ( `' F " ( ( int `  K ) `
 S ) )  e.  J )
1513, 14syldan 456 . 2  |-  ( ( F  e.  ( J  Cn  K )  /\  S  C_  Y )  -> 
( `' F "
( ( int `  K
) `  S )
)  e.  J )
165ntrss2 16810 . . . 4  |-  ( ( K  e.  Top  /\  S  C_  Y )  -> 
( ( int `  K
) `  S )  C_  S )
1711, 16sylan 457 . . 3  |-  ( ( F  e.  ( J  Cn  K )  /\  S  C_  Y )  -> 
( ( int `  K
) `  S )  C_  S )
18 imass2 5065 . . 3  |-  ( ( ( int `  K
) `  S )  C_  S  ->  ( `' F " ( ( int `  K ) `  S
) )  C_  ( `' F " S ) )
1917, 18syl 15 . 2  |-  ( ( F  e.  ( J  Cn  K )  /\  S  C_  Y )  -> 
( `' F "
( ( int `  K
) `  S )
)  C_  ( `' F " S ) )
204ssntr 16811 . 2  |-  ( ( ( J  e.  Top  /\  ( `' F " S )  C_  U. J
)  /\  ( ( `' F " ( ( int `  K ) `
 S ) )  e.  J  /\  ( `' F " ( ( int `  K ) `
 S ) ) 
C_  ( `' F " S ) ) )  ->  ( `' F " ( ( int `  K
) `  S )
)  C_  ( ( int `  J ) `  ( `' F " S ) ) )
212, 10, 15, 19, 20syl22anc 1183 1  |-  ( ( F  e.  ( J  Cn  K )  /\  S  C_  Y )  -> 
( `' F "
( ( int `  K
) `  S )
)  C_  ( ( int `  J ) `  ( `' F " S ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 358    = wceq 1632    e. wcel 1696    C_ wss 3165   U.cuni 3843   `'ccnv 4704   dom cdm 4705   "cima 4708   -->wf 5267   ` cfv 5271  (class class class)co 5874   Topctop 16647   intcnt 16770    Cn ccn 16970
This theorem is referenced by:  cnntr  17020  hmeontr  17476
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-13 1698  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-rep 4147  ax-sep 4157  ax-nul 4165  ax-pow 4204  ax-pr 4230  ax-un 4528
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-eu 2160  df-mo 2161  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-ral 2561  df-rex 2562  df-reu 2563  df-rab 2565  df-v 2803  df-sbc 3005  df-csb 3095  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3469  df-if 3579  df-pw 3640  df-sn 3659  df-pr 3660  df-op 3662  df-uni 3844  df-iun 3923  df-br 4040  df-opab 4094  df-mpt 4095  df-id 4325  df-xp 4711  df-rel 4712  df-cnv 4713  df-co 4714  df-dm 4715  df-rn 4716  df-res 4717  df-ima 4718  df-iota 5235  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278  df-fv 5279  df-ov 5877  df-oprab 5878  df-mpt2 5879  df-map 6790  df-top 16652  df-topon 16655  df-ntr 16773  df-cn 16973
  Copyright terms: Public domain W3C validator