ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  cnrest Unicode version

Theorem cnrest 15336
Description: Continuity of a restriction from a subspace. (Contributed by Jeff Hankins, 11-Jul-2009.) (Revised by Mario Carneiro, 21-Aug-2015.)
Hypothesis
Ref Expression
cnrest.1  |-  X  = 
U. J
Assertion
Ref Expression
cnrest  |-  ( ( F  e.  ( J  Cn  K )  /\  A  C_  X )  -> 
( F  |`  A )  e.  ( ( Jt  A )  Cn  K ) )

Proof of Theorem cnrest
Dummy variable  o is distinct from all other variables.
StepHypRef Expression
1 cnrest.1 . . . . 5  |-  X  = 
U. J
2 eqid 2238 . . . . 5  |-  U. K  =  U. K
31, 2cnf 15305 . . . 4  |-  ( F  e.  ( J  Cn  K )  ->  F : X --> U. K )
43adantr 276 . . 3  |-  ( ( F  e.  ( J  Cn  K )  /\  A  C_  X )  ->  F : X --> U. K
)
5 simpr 110 . . 3  |-  ( ( F  e.  ( J  Cn  K )  /\  A  C_  X )  ->  A  C_  X )
64, 5fssresd 5566 . 2  |-  ( ( F  e.  ( J  Cn  K )  /\  A  C_  X )  -> 
( F  |`  A ) : A --> U. K
)
7 cnvresima 5277 . . . 4  |-  ( `' ( F  |`  A )
" o )  =  ( ( `' F " o )  i^i  A
)
8 cntop1 15302 . . . . . . 7  |-  ( F  e.  ( J  Cn  K )  ->  J  e.  Top )
98adantr 276 . . . . . 6  |-  ( ( F  e.  ( J  Cn  K )  /\  A  C_  X )  ->  J  e.  Top )
109adantr 276 . . . . 5  |-  ( ( ( F  e.  ( J  Cn  K )  /\  A  C_  X
)  /\  o  e.  K )  ->  J  e.  Top )
111topopn 15109 . . . . . . . 8  |-  ( J  e.  Top  ->  X  e.  J )
12 ssexg 4272 . . . . . . . . 9  |-  ( ( A  C_  X  /\  X  e.  J )  ->  A  e.  _V )
1312ancoms 268 . . . . . . . 8  |-  ( ( X  e.  J  /\  A  C_  X )  ->  A  e.  _V )
1411, 13sylan 283 . . . . . . 7  |-  ( ( J  e.  Top  /\  A  C_  X )  ->  A  e.  _V )
158, 14sylan 283 . . . . . 6  |-  ( ( F  e.  ( J  Cn  K )  /\  A  C_  X )  ->  A  e.  _V )
1615adantr 276 . . . . 5  |-  ( ( ( F  e.  ( J  Cn  K )  /\  A  C_  X
)  /\  o  e.  K )  ->  A  e.  _V )
17 cnima 15321 . . . . . 6  |-  ( ( F  e.  ( J  Cn  K )  /\  o  e.  K )  ->  ( `' F "
o )  e.  J
)
1817adantlr 481 . . . . 5  |-  ( ( ( F  e.  ( J  Cn  K )  /\  A  C_  X
)  /\  o  e.  K )  ->  ( `' F " o )  e.  J )
19 elrestr 13601 . . . . 5  |-  ( ( J  e.  Top  /\  A  e.  _V  /\  ( `' F " o )  e.  J )  -> 
( ( `' F " o )  i^i  A
)  e.  ( Jt  A ) )
2010, 16, 18, 19syl3anc 1278 . . . 4  |-  ( ( ( F  e.  ( J  Cn  K )  /\  A  C_  X
)  /\  o  e.  K )  ->  (
( `' F "
o )  i^i  A
)  e.  ( Jt  A ) )
217, 20eqeltrid 2325 . . 3  |-  ( ( ( F  e.  ( J  Cn  K )  /\  A  C_  X
)  /\  o  e.  K )  ->  ( `' ( F  |`  A ) " o
)  e.  ( Jt  A ) )
2221ralrimiva 2623 . 2  |-  ( ( F  e.  ( J  Cn  K )  /\  A  C_  X )  ->  A. o  e.  K  ( `' ( F  |`  A ) " o
)  e.  ( Jt  A ) )
231toptopon 15119 . . . . 5  |-  ( J  e.  Top  <->  J  e.  (TopOn `  X ) )
248, 23sylib 122 . . . 4  |-  ( F  e.  ( J  Cn  K )  ->  J  e.  (TopOn `  X )
)
25 resttopon 15272 . . . 4  |-  ( ( J  e.  (TopOn `  X )  /\  A  C_  X )  ->  ( Jt  A )  e.  (TopOn `  A ) )
2624, 25sylan 283 . . 3  |-  ( ( F  e.  ( J  Cn  K )  /\  A  C_  X )  -> 
( Jt  A )  e.  (TopOn `  A ) )
27 cntop2 15303 . . . . 5  |-  ( F  e.  ( J  Cn  K )  ->  K  e.  Top )
2827adantr 276 . . . 4  |-  ( ( F  e.  ( J  Cn  K )  /\  A  C_  X )  ->  K  e.  Top )
292toptopon 15119 . . . 4  |-  ( K  e.  Top  <->  K  e.  (TopOn `  U. K ) )
3028, 29sylib 122 . . 3  |-  ( ( F  e.  ( J  Cn  K )  /\  A  C_  X )  ->  K  e.  (TopOn `  U. K ) )
31 iscn 15298 . . 3  |-  ( ( ( Jt  A )  e.  (TopOn `  A )  /\  K  e.  (TopOn `  U. K ) )  ->  ( ( F  |`  A )  e.  ( ( Jt  A )  Cn  K )  <->  ( ( F  |`  A ) : A --> U. K  /\  A. o  e.  K  ( `' ( F  |`  A ) " o
)  e.  ( Jt  A ) ) ) )
3226, 30, 31syl2anc 415 . 2  |-  ( ( F  e.  ( J  Cn  K )  /\  A  C_  X )  -> 
( ( F  |`  A )  e.  ( ( Jt  A )  Cn  K
)  <->  ( ( F  |`  A ) : A --> U. K  /\  A. o  e.  K  ( `' ( F  |`  A )
" o )  e.  ( Jt  A ) ) ) )
336, 22, 32mpbir2and 957 1  |-  ( ( F  e.  ( J  Cn  K )  /\  A  C_  X )  -> 
( F  |`  A )  e.  ( ( Jt  A )  Cn  K ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209   A.wral 2528   _Vcvv 2821    i^i cin 3219    C_ wss 3220   U.cuni 3935   `'ccnv 4773    |` cres 4776   "cima 4777   -->wf 5373   ` cfv 5377  (class class class)co 6085   ↾t crest 13593   Topctop 15098  TopOnctopon 15111    Cn ccn 15286
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-map 6924  df-rest 13595  df-topgen 13614  df-top 15099  df-topon 15112  df-bases 15144  df-cn 15289
This theorem is used by:  cnmpt1res  15397  cnmpt2res  15398  hmeores  15416
  Copyright terms: Public domain W3C validator