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

Theorem limcresi 15767
Description: Any limit of  F is also a limit of the restriction of  F. (Contributed by Mario Carneiro, 28-Dec-2016.)
Assertion
Ref Expression
limcresi  |-  ( F lim
CC  B )  C_  ( ( F  |`  C ) lim CC  B )

Proof of Theorem limcresi
Dummy variables  d  e  u  x are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 limcrcl 15759 . . . . . . 7  |-  ( x  e.  ( F lim CC  B )  ->  ( F : dom  F --> CC  /\  dom  F  C_  CC  /\  B  e.  CC ) )
21simp1d 1040 . . . . . 6  |-  ( x  e.  ( F lim CC  B )  ->  F : dom  F --> CC )
31simp2d 1041 . . . . . 6  |-  ( x  e.  ( F lim CC  B )  ->  dom  F 
C_  CC )
41simp3d 1042 . . . . . 6  |-  ( x  e.  ( F lim CC  B )  ->  B  e.  CC )
52, 3, 4ellimc3ap 15762 . . . . 5  |-  ( x  e.  ( F lim CC  B )  ->  (
x  e.  ( F lim
CC  B )  <->  ( x  e.  CC  /\  A. e  e.  RR+  E. d  e.  RR+  A. u  e.  dom  F ( ( u #  B  /\  ( abs `  (
u  -  B ) )  <  d )  ->  ( abs `  (
( F `  u
)  -  x ) )  <  e ) ) ) )
65ibi 176 . . . 4  |-  ( x  e.  ( F lim CC  B )  ->  (
x  e.  CC  /\  A. e  e.  RR+  E. d  e.  RR+  A. u  e. 
dom  F ( ( u #  B  /\  ( abs `  ( u  -  B ) )  < 
d )  ->  ( abs `  ( ( F `
 u )  -  x ) )  < 
e ) ) )
7 inss1 3451 . . . . . . . . 9  |-  ( dom 
F  i^i  C )  C_ 
dom  F
8 ssralv 3312 . . . . . . . . 9  |-  ( ( dom  F  i^i  C
)  C_  dom  F  -> 
( A. u  e. 
dom  F ( ( u #  B  /\  ( abs `  ( u  -  B ) )  < 
d )  ->  ( abs `  ( ( F `
 u )  -  x ) )  < 
e )  ->  A. u  e.  ( dom  F  i^i  C ) ( ( u #  B  /\  ( abs `  ( u  -  B
) )  <  d
)  ->  ( abs `  ( ( F `  u )  -  x
) )  <  e
) ) )
97, 8ax-mp 5 . . . . . . . 8  |-  ( A. u  e.  dom  F ( ( u #  B  /\  ( abs `  ( u  -  B ) )  <  d )  -> 
( abs `  (
( F `  u
)  -  x ) )  <  e )  ->  A. u  e.  ( dom  F  i^i  C
) ( ( u #  B  /\  ( abs `  ( u  -  B
) )  <  d
)  ->  ( abs `  ( ( F `  u )  -  x
) )  <  e
) )
10 elinel2 3416 . . . . . . . . . . . . . . 15  |-  ( u  e.  ( dom  F  i^i  C )  ->  u  e.  C )
11 fvres 5719 . . . . . . . . . . . . . . 15  |-  ( u  e.  C  ->  (
( F  |`  C ) `
 u )  =  ( F `  u
) )
1210, 11syl 14 . . . . . . . . . . . . . 14  |-  ( u  e.  ( dom  F  i^i  C )  ->  (
( F  |`  C ) `
 u )  =  ( F `  u
) )
1312adantl 277 . . . . . . . . . . . . 13  |-  ( ( x  e.  ( F lim
CC  B )  /\  u  e.  ( dom  F  i^i  C ) )  ->  ( ( F  |`  C ) `  u
)  =  ( F `
 u ) )
1413fvoveq1d 6107 . . . . . . . . . . . 12  |-  ( ( x  e.  ( F lim
CC  B )  /\  u  e.  ( dom  F  i^i  C ) )  ->  ( abs `  (
( ( F  |`  C ) `  u
)  -  x ) )  =  ( abs `  ( ( F `  u )  -  x
) ) )
1514breq1d 4140 . . . . . . . . . . 11  |-  ( ( x  e.  ( F lim
CC  B )  /\  u  e.  ( dom  F  i^i  C ) )  ->  ( ( abs `  ( ( ( F  |`  C ) `  u
)  -  x ) )  <  e  <->  ( abs `  ( ( F `  u )  -  x
) )  <  e
) )
1615imbi2d 230 . . . . . . . . . 10  |-  ( ( x  e.  ( F lim
CC  B )  /\  u  e.  ( dom  F  i^i  C ) )  ->  ( ( ( u #  B  /\  ( abs `  ( u  -  B ) )  < 
d )  ->  ( abs `  ( ( ( F  |`  C ) `  u )  -  x
) )  <  e
)  <->  ( ( u #  B  /\  ( abs `  ( u  -  B
) )  <  d
)  ->  ( abs `  ( ( F `  u )  -  x
) )  <  e
) ) )
1716biimprd 158 . . . . . . . . 9  |-  ( ( x  e.  ( F lim
CC  B )  /\  u  e.  ( dom  F  i^i  C ) )  ->  ( ( ( u #  B  /\  ( abs `  ( u  -  B ) )  < 
d )  ->  ( abs `  ( ( F `
 u )  -  x ) )  < 
e )  ->  (
( u #  B  /\  ( abs `  ( u  -  B ) )  <  d )  -> 
( abs `  (
( ( F  |`  C ) `  u
)  -  x ) )  <  e ) ) )
1817ralimdva 2617 . . . . . . . 8  |-  ( x  e.  ( F lim CC  B )  ->  ( A. u  e.  ( dom  F  i^i  C ) ( ( u #  B  /\  ( abs `  (
u  -  B ) )  <  d )  ->  ( abs `  (
( F `  u
)  -  x ) )  <  e )  ->  A. u  e.  ( dom  F  i^i  C
) ( ( u #  B  /\  ( abs `  ( u  -  B
) )  <  d
)  ->  ( abs `  ( ( ( F  |`  C ) `  u
)  -  x ) )  <  e ) ) )
199, 18syl5 32 . . . . . . 7  |-  ( x  e.  ( F lim CC  B )  ->  ( A. u  e.  dom  F ( ( u #  B  /\  ( abs `  (
u  -  B ) )  <  d )  ->  ( abs `  (
( F `  u
)  -  x ) )  <  e )  ->  A. u  e.  ( dom  F  i^i  C
) ( ( u #  B  /\  ( abs `  ( u  -  B
) )  <  d
)  ->  ( abs `  ( ( ( F  |`  C ) `  u
)  -  x ) )  <  e ) ) )
2019reximdv 2651 . . . . . 6  |-  ( x  e.  ( F lim CC  B )  ->  ( E. d  e.  RR+  A. u  e.  dom  F ( ( u #  B  /\  ( abs `  ( u  -  B ) )  < 
d )  ->  ( abs `  ( ( F `
 u )  -  x ) )  < 
e )  ->  E. d  e.  RR+  A. u  e.  ( dom  F  i^i  C ) ( ( u #  B  /\  ( abs `  ( u  -  B
) )  <  d
)  ->  ( abs `  ( ( ( F  |`  C ) `  u
)  -  x ) )  <  e ) ) )
2120ralimdv 2618 . . . . 5  |-  ( x  e.  ( F lim CC  B )  ->  ( A. e  e.  RR+  E. d  e.  RR+  A. u  e. 
dom  F ( ( u #  B  /\  ( abs `  ( u  -  B ) )  < 
d )  ->  ( abs `  ( ( F `
 u )  -  x ) )  < 
e )  ->  A. e  e.  RR+  E. d  e.  RR+  A. u  e.  ( dom  F  i^i  C
) ( ( u #  B  /\  ( abs `  ( u  -  B
) )  <  d
)  ->  ( abs `  ( ( ( F  |`  C ) `  u
)  -  x ) )  <  e ) ) )
2221anim2d 337 . . . 4  |-  ( x  e.  ( F lim CC  B )  ->  (
( x  e.  CC  /\ 
A. e  e.  RR+  E. d  e.  RR+  A. u  e.  dom  F ( ( u #  B  /\  ( abs `  ( u  -  B ) )  < 
d )  ->  ( abs `  ( ( F `
 u )  -  x ) )  < 
e ) )  -> 
( x  e.  CC  /\ 
A. e  e.  RR+  E. d  e.  RR+  A. u  e.  ( dom  F  i^i  C ) ( ( u #  B  /\  ( abs `  ( u  -  B
) )  <  d
)  ->  ( abs `  ( ( ( F  |`  C ) `  u
)  -  x ) )  <  e ) ) ) )
236, 22mpd 13 . . 3  |-  ( x  e.  ( F lim CC  B )  ->  (
x  e.  CC  /\  A. e  e.  RR+  E. d  e.  RR+  A. u  e.  ( dom  F  i^i  C ) ( ( u #  B  /\  ( abs `  ( u  -  B
) )  <  d
)  ->  ( abs `  ( ( ( F  |`  C ) `  u
)  -  x ) )  <  e ) ) )
24 fresin 5568 . . . . 5  |-  ( F : dom  F --> CC  ->  ( F  |`  C ) : ( dom  F  i^i  C ) --> CC )
252, 24syl 14 . . . 4  |-  ( x  e.  ( F lim CC  B )  ->  ( F  |`  C ) : ( dom  F  i^i  C ) --> CC )
267, 3sstrid 3259 . . . 4  |-  ( x  e.  ( F lim CC  B )  ->  ( dom  F  i^i  C ) 
C_  CC )
2725, 26, 4ellimc3ap 15762 . . 3  |-  ( x  e.  ( F lim CC  B )  ->  (
x  e.  ( ( F  |`  C ) lim CC  B )  <->  ( x  e.  CC  /\  A. e  e.  RR+  E. d  e.  RR+  A. u  e.  ( dom  F  i^i  C
) ( ( u #  B  /\  ( abs `  ( u  -  B
) )  <  d
)  ->  ( abs `  ( ( ( F  |`  C ) `  u
)  -  x ) )  <  e ) ) ) )
2823, 27mpbird 167 . 2  |-  ( x  e.  ( F lim CC  B )  ->  x  e.  ( ( F  |`  C ) lim CC  B ) )
2928ssriv 3252 1  |-  ( F lim
CC  B )  C_  ( ( F  |`  C ) lim CC  B )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   A.wral 2528   E.wrex 2529    i^i cin 3219    C_ wss 3220   class class class wbr 4130   dom cdm 4774    |` cres 4776   -->wf 5373   ` cfv 5377  (class class class)co 6085   CCcc 8177    < clt 8360    - cmin 8497   # cap 8909   RR+crp 10054   abscabs 11763   lim CC climc 15755
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-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270
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-rab 2537  df-v 2823  df-sbc 3052  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-br 4131  df-opab 4193  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-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pm 6925  df-limced 15757
This theorem is used by:  dvidlemap  15792  dvidrelem  15793  dvidsslem  15794  dvcnp2cntop  15800  dvcoapbr  15808
  Copyright terms: Public domain W3C validator