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

Theorem limcdifap 15527
Description: It suffices to consider functions which are not defined at 
B to define the limit of a function. In particular, the value of the original function  F at  B does not affect the limit of  F. (Contributed by Mario Carneiro, 25-Dec-2016.) (Revised by Jim Kingdon, 3-Jun-2023.)
Hypotheses
Ref Expression
limccl.f  |-  ( ph  ->  F : A --> CC )
limcdifap.a  |-  ( ph  ->  A  C_  CC )
Assertion
Ref Expression
limcdifap  |-  ( ph  ->  ( F lim CC  B
)  =  ( ( F  |`  { x  e.  A  |  x #  B } ) lim CC  B
) )
Distinct variable groups:    x, A    x, B
Allowed substitution hints:    ph( x)    F( x)

Proof of Theorem limcdifap
Dummy variables  d  e  u  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 limcrcl 15523 . . . . 5  |-  ( u  e.  ( F lim CC  B )  ->  ( F : dom  F --> CC  /\  dom  F  C_  CC  /\  B  e.  CC ) )
21simp3d 1038 . . . 4  |-  ( u  e.  ( F lim CC  B )  ->  B  e.  CC )
32a1i 9 . . 3  |-  ( ph  ->  ( u  e.  ( F lim CC  B )  ->  B  e.  CC ) )
4 limcrcl 15523 . . . . 5  |-  ( u  e.  ( ( F  |`  { x  e.  A  |  x #  B }
) lim CC  B )  ->  ( ( F  |`  { x  e.  A  |  x #  B }
) : dom  ( F  |`  { x  e.  A  |  x #  B } ) --> CC  /\  dom  ( F  |`  { x  e.  A  |  x #  B } )  C_  CC  /\  B  e.  CC ) )
54simp3d 1038 . . . 4  |-  ( u  e.  ( ( F  |`  { x  e.  A  |  x #  B }
) lim CC  B )  ->  B  e.  CC )
65a1i 9 . . 3  |-  ( ph  ->  ( u  e.  ( ( F  |`  { x  e.  A  |  x #  B } ) lim CC  B
)  ->  B  e.  CC ) )
7 breq1 4112 . . . . . . . . . . . . . . . . 17  |-  ( x  =  z  ->  (
x #  B  <->  z #  B
) )
8 simplr 529 . . . . . . . . . . . . . . . . 17  |-  ( ( ( ( ph  /\  B  e.  CC )  /\  z  e.  A
)  /\  z #  B
)  ->  z  e.  A )
9 simpr 110 . . . . . . . . . . . . . . . . 17  |-  ( ( ( ( ph  /\  B  e.  CC )  /\  z  e.  A
)  /\  z #  B
)  ->  z #  B
)
107, 8, 9elrabd 2975 . . . . . . . . . . . . . . . 16  |-  ( ( ( ( ph  /\  B  e.  CC )  /\  z  e.  A
)  /\  z #  B
)  ->  z  e.  { x  e.  A  |  x #  B } )
11 fvres 5694 . . . . . . . . . . . . . . . . 17  |-  ( z  e.  { x  e.  A  |  x #  B }  ->  ( ( F  |`  { x  e.  A  |  x #  B }
) `  z )  =  ( F `  z ) )
1211eqcomd 2238 . . . . . . . . . . . . . . . 16  |-  ( z  e.  { x  e.  A  |  x #  B }  ->  ( F `  z )  =  ( ( F  |`  { x  e.  A  |  x #  B } ) `  z
) )
1310, 12syl 14 . . . . . . . . . . . . . . 15  |-  ( ( ( ( ph  /\  B  e.  CC )  /\  z  e.  A
)  /\  z #  B
)  ->  ( F `  z )  =  ( ( F  |`  { x  e.  A  |  x #  B } ) `  z
) )
1413fvoveq1d 6072 . . . . . . . . . . . . . 14  |-  ( ( ( ( ph  /\  B  e.  CC )  /\  z  e.  A
)  /\  z #  B
)  ->  ( abs `  ( ( F `  z )  -  u
) )  =  ( abs `  ( ( ( F  |`  { x  e.  A  |  x #  B } ) `  z
)  -  u ) ) )
1514breq1d 4119 . . . . . . . . . . . . 13  |-  ( ( ( ( ph  /\  B  e.  CC )  /\  z  e.  A
)  /\  z #  B
)  ->  ( ( abs `  ( ( F `
 z )  -  u ) )  < 
e  <->  ( abs `  (
( ( F  |`  { x  e.  A  |  x #  B }
) `  z )  -  u ) )  < 
e ) )
1615imbi2d 230 . . . . . . . . . . . 12  |-  ( ( ( ( ph  /\  B  e.  CC )  /\  z  e.  A
)  /\  z #  B
)  ->  ( (
( abs `  (
z  -  B ) )  <  d  -> 
( abs `  (
( F `  z
)  -  u ) )  <  e )  <-> 
( ( abs `  (
z  -  B ) )  <  d  -> 
( abs `  (
( ( F  |`  { x  e.  A  |  x #  B }
) `  z )  -  u ) )  < 
e ) ) )
1716pm5.74da 443 . . . . . . . . . . 11  |-  ( ( ( ph  /\  B  e.  CC )  /\  z  e.  A )  ->  (
( z #  B  -> 
( ( abs `  (
z  -  B ) )  <  d  -> 
( abs `  (
( F `  z
)  -  u ) )  <  e ) )  <->  ( z #  B  ->  ( ( abs `  (
z  -  B ) )  <  d  -> 
( abs `  (
( ( F  |`  { x  e.  A  |  x #  B }
) `  z )  -  u ) )  < 
e ) ) ) )
18 impexp 263 . . . . . . . . . . 11  |-  ( ( ( z #  B  /\  ( abs `  ( z  -  B ) )  <  d )  -> 
( abs `  (
( F `  z
)  -  u ) )  <  e )  <-> 
( z #  B  -> 
( ( abs `  (
z  -  B ) )  <  d  -> 
( abs `  (
( F `  z
)  -  u ) )  <  e ) ) )
19 impexp 263 . . . . . . . . . . . . 13  |-  ( ( ( z #  B  /\  ( abs `  ( z  -  B ) )  <  d )  -> 
( abs `  (
( ( F  |`  { x  e.  A  |  x #  B }
) `  z )  -  u ) )  < 
e )  <->  ( z #  B  ->  ( ( abs `  ( z  -  B
) )  <  d  ->  ( abs `  (
( ( F  |`  { x  e.  A  |  x #  B }
) `  z )  -  u ) )  < 
e ) ) )
2019imbi2i 226 . . . . . . . . . . . 12  |-  ( ( z #  B  ->  (
( z #  B  /\  ( abs `  ( z  -  B ) )  <  d )  -> 
( abs `  (
( ( F  |`  { x  e.  A  |  x #  B }
) `  z )  -  u ) )  < 
e ) )  <->  ( z #  B  ->  ( z #  B  ->  ( ( abs `  (
z  -  B ) )  <  d  -> 
( abs `  (
( ( F  |`  { x  e.  A  |  x #  B }
) `  z )  -  u ) )  < 
e ) ) ) )
21 pm5.4 249 . . . . . . . . . . . 12  |-  ( ( z #  B  ->  (
z #  B  ->  (
( abs `  (
z  -  B ) )  <  d  -> 
( abs `  (
( ( F  |`  { x  e.  A  |  x #  B }
) `  z )  -  u ) )  < 
e ) ) )  <-> 
( z #  B  -> 
( ( abs `  (
z  -  B ) )  <  d  -> 
( abs `  (
( ( F  |`  { x  e.  A  |  x #  B }
) `  z )  -  u ) )  < 
e ) ) )
2220, 21bitri 184 . . . . . . . . . . 11  |-  ( ( z #  B  ->  (
( z #  B  /\  ( abs `  ( z  -  B ) )  <  d )  -> 
( abs `  (
( ( F  |`  { x  e.  A  |  x #  B }
) `  z )  -  u ) )  < 
e ) )  <->  ( z #  B  ->  ( ( abs `  ( z  -  B
) )  <  d  ->  ( abs `  (
( ( F  |`  { x  e.  A  |  x #  B }
) `  z )  -  u ) )  < 
e ) ) )
2317, 18, 223bitr4g 223 . . . . . . . . . 10  |-  ( ( ( ph  /\  B  e.  CC )  /\  z  e.  A )  ->  (
( ( z #  B  /\  ( abs `  (
z  -  B ) )  <  d )  ->  ( abs `  (
( F `  z
)  -  u ) )  <  e )  <-> 
( z #  B  -> 
( ( z #  B  /\  ( abs `  (
z  -  B ) )  <  d )  ->  ( abs `  (
( ( F  |`  { x  e.  A  |  x #  B }
) `  z )  -  u ) )  < 
e ) ) ) )
2423ralbidva 2538 . . . . . . . . 9  |-  ( (
ph  /\  B  e.  CC )  ->  ( A. z  e.  A  (
( z #  B  /\  ( abs `  ( z  -  B ) )  <  d )  -> 
( abs `  (
( F `  z
)  -  u ) )  <  e )  <->  A. z  e.  A  ( z #  B  ->  ( ( z #  B  /\  ( abs `  ( z  -  B ) )  <  d )  -> 
( abs `  (
( ( F  |`  { x  e.  A  |  x #  B }
) `  z )  -  u ) )  < 
e ) ) ) )
257ralrab 2978 . . . . . . . . 9  |-  ( A. z  e.  { x  e.  A  |  x #  B }  ( (
z #  B  /\  ( abs `  ( z  -  B ) )  < 
d )  ->  ( abs `  ( ( ( F  |`  { x  e.  A  |  x #  B } ) `  z
)  -  u ) )  <  e )  <->  A. z  e.  A  ( z #  B  ->  ( ( z #  B  /\  ( abs `  ( z  -  B ) )  <  d )  -> 
( abs `  (
( ( F  |`  { x  e.  A  |  x #  B }
) `  z )  -  u ) )  < 
e ) ) )
2624, 25bitr4di 198 . . . . . . . 8  |-  ( (
ph  /\  B  e.  CC )  ->  ( A. z  e.  A  (
( z #  B  /\  ( abs `  ( z  -  B ) )  <  d )  -> 
( abs `  (
( F `  z
)  -  u ) )  <  e )  <->  A. z  e.  { x  e.  A  |  x #  B }  ( (
z #  B  /\  ( abs `  ( z  -  B ) )  < 
d )  ->  ( abs `  ( ( ( F  |`  { x  e.  A  |  x #  B } ) `  z
)  -  u ) )  <  e ) ) )
2726rexbidv 2543 . . . . . . 7  |-  ( (
ph  /\  B  e.  CC )  ->  ( E. d  e.  RR+  A. z  e.  A  ( (
z #  B  /\  ( abs `  ( z  -  B ) )  < 
d )  ->  ( abs `  ( ( F `
 z )  -  u ) )  < 
e )  <->  E. d  e.  RR+  A. z  e. 
{ x  e.  A  |  x #  B } 
( ( z #  B  /\  ( abs `  (
z  -  B ) )  <  d )  ->  ( abs `  (
( ( F  |`  { x  e.  A  |  x #  B }
) `  z )  -  u ) )  < 
e ) ) )
2827ralbidv 2542 . . . . . 6  |-  ( (
ph  /\  B  e.  CC )  ->  ( A. e  e.  RR+  E. d  e.  RR+  A. z  e.  A  ( ( z #  B  /\  ( abs `  ( z  -  B
) )  <  d
)  ->  ( abs `  ( ( F `  z )  -  u
) )  <  e
)  <->  A. e  e.  RR+  E. d  e.  RR+  A. z  e.  { x  e.  A  |  x #  B } 
( ( z #  B  /\  ( abs `  (
z  -  B ) )  <  d )  ->  ( abs `  (
( ( F  |`  { x  e.  A  |  x #  B }
) `  z )  -  u ) )  < 
e ) ) )
2928anbi2d 464 . . . . 5  |-  ( (
ph  /\  B  e.  CC )  ->  ( ( u  e.  CC  /\  A. e  e.  RR+  E. d  e.  RR+  A. z  e.  A  ( ( z #  B  /\  ( abs `  ( z  -  B
) )  <  d
)  ->  ( abs `  ( ( F `  z )  -  u
) )  <  e
) )  <->  ( u  e.  CC  /\  A. e  e.  RR+  E. d  e.  RR+  A. z  e.  {
x  e.  A  |  x #  B }  ( ( z #  B  /\  ( abs `  ( z  -  B ) )  < 
d )  ->  ( abs `  ( ( ( F  |`  { x  e.  A  |  x #  B } ) `  z
)  -  u ) )  <  e ) ) ) )
30 limccl.f . . . . . . 7  |-  ( ph  ->  F : A --> CC )
3130adantr 276 . . . . . 6  |-  ( (
ph  /\  B  e.  CC )  ->  F : A
--> CC )
32 limcdifap.a . . . . . . 7  |-  ( ph  ->  A  C_  CC )
3332adantr 276 . . . . . 6  |-  ( (
ph  /\  B  e.  CC )  ->  A  C_  CC )
34 simpr 110 . . . . . 6  |-  ( (
ph  /\  B  e.  CC )  ->  B  e.  CC )
3531, 33, 34ellimc3ap 15526 . . . . 5  |-  ( (
ph  /\  B  e.  CC )  ->  ( u  e.  ( F lim CC  B )  <->  ( u  e.  CC  /\  A. e  e.  RR+  E. d  e.  RR+  A. z  e.  A  ( ( z #  B  /\  ( abs `  (
z  -  B ) )  <  d )  ->  ( abs `  (
( F `  z
)  -  u ) )  <  e ) ) ) )
36 ssrab2 3323 . . . . . . 7  |-  { x  e.  A  |  x #  B }  C_  A
37 fssres 5540 . . . . . . 7  |-  ( ( F : A --> CC  /\  { x  e.  A  |  x #  B }  C_  A
)  ->  ( F  |` 
{ x  e.  A  |  x #  B }
) : { x  e.  A  |  x #  B } --> CC )
3831, 36, 37sylancl 413 . . . . . 6  |-  ( (
ph  /\  B  e.  CC )  ->  ( F  |`  { x  e.  A  |  x #  B }
) : { x  e.  A  |  x #  B } --> CC )
3936, 33sstrid 3249 . . . . . 6  |-  ( (
ph  /\  B  e.  CC )  ->  { x  e.  A  |  x #  B }  C_  CC )
4038, 39, 34ellimc3ap 15526 . . . . 5  |-  ( (
ph  /\  B  e.  CC )  ->  ( u  e.  ( ( F  |`  { x  e.  A  |  x #  B }
) lim CC  B )  <->  ( u  e.  CC  /\  A. e  e.  RR+  E. d  e.  RR+  A. z  e. 
{ x  e.  A  |  x #  B } 
( ( z #  B  /\  ( abs `  (
z  -  B ) )  <  d )  ->  ( abs `  (
( ( F  |`  { x  e.  A  |  x #  B }
) `  z )  -  u ) )  < 
e ) ) ) )
4129, 35, 403bitr4d 220 . . . 4  |-  ( (
ph  /\  B  e.  CC )  ->  ( u  e.  ( F lim CC  B )  <->  u  e.  ( ( F  |`  { x  e.  A  |  x #  B }
) lim CC  B )
) )
4241ex 115 . . 3  |-  ( ph  ->  ( B  e.  CC  ->  ( u  e.  ( F lim CC  B )  <-> 
u  e.  ( ( F  |`  { x  e.  A  |  x #  B } ) lim CC  B
) ) ) )
433, 6, 42pm5.21ndd 713 . 2  |-  ( ph  ->  ( u  e.  ( F lim CC  B )  <-> 
u  e.  ( ( F  |`  { x  e.  A  |  x #  B } ) lim CC  B
) ) )
4443eqrdv 2230 1  |-  ( ph  ->  ( F lim CC  B
)  =  ( ( F  |`  { x  e.  A  |  x #  B } ) lim CC  B
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2203   A.wral 2520   E.wrex 2521   {crab 2524    C_ wss 3211   class class class wbr 4109   dom cdm 4749    |` cres 4751   -->wf 5348   ` cfv 5352  (class class class)co 6050   CCcc 8125    < clt 8308    - cmin 8444   # cap 8855   RR+crp 9986   abscabs 11682   lim CC climc 15519
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-cnex 8218
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-rab 2529  df-v 2815  df-sbc 3043  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-opab 4172  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-fv 5360  df-ov 6053  df-oprab 6054  df-mpo 6055  df-pm 6885  df-limced 15521
This theorem is referenced by:  dvcnp2cntop  15564  dvmulxxbr  15567  dvrecap  15578
  Copyright terms: Public domain W3C validator