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

Theorem eldvap 15356
Description: The differentiable predicate. A function  F is differentiable at  B with derivative  C iff  F is defined in a neighborhood of  B and the difference quotient has limit  C at  B. (Contributed by Mario Carneiro, 7-Aug-2014.) (Revised by Jim Kingdon, 27-Jun-2023.)
Hypotheses
Ref Expression
dvval.t  |-  T  =  ( Kt  S )
dvval.k  |-  K  =  ( MetOpen `  ( abs  o. 
-  ) )
eldvap.g  |-  G  =  ( z  e.  {
w  e.  A  |  w #  B }  |->  ( ( ( F `  z
)  -  ( F `
 B ) )  /  ( z  -  B ) ) )
eldv.s  |-  ( ph  ->  S  C_  CC )
eldv.f  |-  ( ph  ->  F : A --> CC )
eldv.a  |-  ( ph  ->  A  C_  S )
Assertion
Ref Expression
eldvap  |-  ( ph  ->  ( B ( S  _D  F ) C  <-> 
( B  e.  ( ( int `  T
) `  A )  /\  C  e.  ( G lim CC  B ) ) ) )
Distinct variable groups:    w, A, z   
w, F, z    w, S, z    z, B, w
Allowed substitution hints:    ph( z, w)    C( z, w)    T( z, w)    G( z, w)    K( z, w)

Proof of Theorem eldvap
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 eldv.s . . . . 5  |-  ( ph  ->  S  C_  CC )
2 eldv.f . . . . 5  |-  ( ph  ->  F : A --> CC )
3 eldv.a . . . . 5  |-  ( ph  ->  A  C_  S )
4 dvval.t . . . . . 6  |-  T  =  ( Kt  S )
5 dvval.k . . . . . 6  |-  K  =  ( MetOpen `  ( abs  o. 
-  ) )
64, 5dvfvalap 15355 . . . . 5  |-  ( ( S  C_  CC  /\  F : A --> CC  /\  A  C_  S )  ->  (
( S  _D  F
)  =  U_ x  e.  ( ( int `  T
) `  A )
( { x }  X.  ( ( z  e. 
{ w  e.  A  |  w #  x }  |->  ( ( ( F `
 z )  -  ( F `  x ) )  /  ( z  -  x ) ) ) lim CC  x ) )  /\  ( S  _D  F )  C_  ( ( ( int `  T ) `  A
)  X.  CC ) ) )
71, 2, 3, 6syl3anc 1271 . . . 4  |-  ( ph  ->  ( ( S  _D  F )  =  U_ x  e.  ( ( int `  T ) `  A ) ( { x }  X.  (
( z  e.  {
w  e.  A  |  w #  x }  |->  ( ( ( F `  z
)  -  ( F `
 x ) )  /  ( z  -  x ) ) ) lim
CC  x ) )  /\  ( S  _D  F )  C_  (
( ( int `  T
) `  A )  X.  CC ) ) )
87simpld 112 . . 3  |-  ( ph  ->  ( S  _D  F
)  =  U_ x  e.  ( ( int `  T
) `  A )
( { x }  X.  ( ( z  e. 
{ w  e.  A  |  w #  x }  |->  ( ( ( F `
 z )  -  ( F `  x ) )  /  ( z  -  x ) ) ) lim CC  x ) ) )
98eleq2d 2299 . 2  |-  ( ph  ->  ( <. B ,  C >.  e.  ( S  _D  F )  <->  <. B ,  C >.  e.  U_ x  e.  ( ( int `  T
) `  A )
( { x }  X.  ( ( z  e. 
{ w  e.  A  |  w #  x }  |->  ( ( ( F `
 z )  -  ( F `  x ) )  /  ( z  -  x ) ) ) lim CC  x ) ) ) )
10 df-br 4084 . . 3  |-  ( B ( S  _D  F
) C  <->  <. B ,  C >.  e.  ( S  _D  F ) )
1110bicomi 132 . 2  |-  ( <. B ,  C >.  e.  ( S  _D  F
)  <->  B ( S  _D  F ) C )
12 breq2 4087 . . . . . . 7  |-  ( x  =  B  ->  (
w #  x  <->  w #  B
) )
1312rabbidv 2788 . . . . . 6  |-  ( x  =  B  ->  { w  e.  A  |  w #  x }  =  {
w  e.  A  |  w #  B } )
14 fveq2 5627 . . . . . . . 8  |-  ( x  =  B  ->  ( F `  x )  =  ( F `  B ) )
1514oveq2d 6017 . . . . . . 7  |-  ( x  =  B  ->  (
( F `  z
)  -  ( F `
 x ) )  =  ( ( F `
 z )  -  ( F `  B ) ) )
16 oveq2 6009 . . . . . . 7  |-  ( x  =  B  ->  (
z  -  x )  =  ( z  -  B ) )
1715, 16oveq12d 6019 . . . . . 6  |-  ( x  =  B  ->  (
( ( F `  z )  -  ( F `  x )
)  /  ( z  -  x ) )  =  ( ( ( F `  z )  -  ( F `  B ) )  / 
( z  -  B
) ) )
1813, 17mpteq12dv 4166 . . . . 5  |-  ( x  =  B  ->  (
z  e.  { w  e.  A  |  w #  x }  |->  ( ( ( F `  z
)  -  ( F `
 x ) )  /  ( z  -  x ) ) )  =  ( z  e. 
{ w  e.  A  |  w #  B }  |->  ( ( ( F `
 z )  -  ( F `  B ) )  /  ( z  -  B ) ) ) )
19 eldvap.g . . . . 5  |-  G  =  ( z  e.  {
w  e.  A  |  w #  B }  |->  ( ( ( F `  z
)  -  ( F `
 B ) )  /  ( z  -  B ) ) )
2018, 19eqtr4di 2280 . . . 4  |-  ( x  =  B  ->  (
z  e.  { w  e.  A  |  w #  x }  |->  ( ( ( F `  z
)  -  ( F `
 x ) )  /  ( z  -  x ) ) )  =  G )
21 id 19 . . . 4  |-  ( x  =  B  ->  x  =  B )
2220, 21oveq12d 6019 . . 3  |-  ( x  =  B  ->  (
( z  e.  {
w  e.  A  |  w #  x }  |->  ( ( ( F `  z
)  -  ( F `
 x ) )  /  ( z  -  x ) ) ) lim
CC  x )  =  ( G lim CC  B
) )
2322opeliunxp2 4862 . 2  |-  ( <. B ,  C >.  e. 
U_ x  e.  ( ( int `  T
) `  A )
( { x }  X.  ( ( z  e. 
{ w  e.  A  |  w #  x }  |->  ( ( ( F `
 z )  -  ( F `  x ) )  /  ( z  -  x ) ) ) lim CC  x ) )  <->  ( B  e.  ( ( int `  T
) `  A )  /\  C  e.  ( G lim CC  B ) ) )
249, 11, 233bitr3g 222 1  |-  ( ph  ->  ( B ( S  _D  F ) C  <-> 
( B  e.  ( ( int `  T
) `  A )  /\  C  e.  ( G lim CC  B ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1395    e. wcel 2200   {crab 2512    C_ wss 3197   {csn 3666   <.cop 3669   U_ciun 3965   class class class wbr 4083    |-> cmpt 4145    X. cxp 4717    o. ccom 4723   -->wf 5314   ` cfv 5318  (class class class)co 6001   CCcc 7997    - cmin 8317   # cap 8728    / cdiv 8819   abscabs 11508   ↾t crest 13272   MetOpencmopn 14505   intcnt 14767   lim CC climc 15328    _D cdv 15329
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-nul 4210  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-iinf 4680  ax-cnex 8090  ax-resscn 8091  ax-1cn 8092  ax-1re 8093  ax-icn 8094  ax-addcl 8095  ax-addrcl 8096  ax-mulcl 8097  ax-mulrcl 8098  ax-addcom 8099  ax-mulcom 8100  ax-addass 8101  ax-mulass 8102  ax-distr 8103  ax-i2m1 8104  ax-0lt1 8105  ax-1rid 8106  ax-0id 8107  ax-rnegex 8108  ax-precex 8109  ax-cnre 8110  ax-pre-ltirr 8111  ax-pre-ltwlin 8112  ax-pre-lttrn 8113  ax-pre-apti 8114  ax-pre-ltadd 8115  ax-pre-mulgt0 8116  ax-pre-mulext 8117  ax-arch 8118  ax-caucvg 8119
This theorem depends on definitions:  df-bi 117  df-stab 836  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-if 3603  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-tr 4183  df-id 4384  df-po 4387  df-iso 4388  df-iord 4457  df-on 4459  df-ilim 4460  df-suc 4462  df-iom 4683  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-isom 5327  df-riota 5954  df-ov 6004  df-oprab 6005  df-mpo 6006  df-1st 6286  df-2nd 6287  df-recs 6451  df-frec 6537  df-map 6797  df-pm 6798  df-sup 7151  df-inf 7152  df-pnf 8183  df-mnf 8184  df-xr 8185  df-ltxr 8186  df-le 8187  df-sub 8319  df-neg 8320  df-reap 8722  df-ap 8729  df-div 8820  df-inn 9111  df-2 9169  df-3 9170  df-4 9171  df-n0 9370  df-z 9447  df-uz 9723  df-q 9815  df-rp 9850  df-xneg 9968  df-xadd 9969  df-seqfrec 10670  df-exp 10761  df-cj 11353  df-re 11354  df-im 11355  df-rsqrt 11509  df-abs 11510  df-rest 13274  df-topgen 13293  df-psmet 14507  df-xmet 14508  df-met 14509  df-bl 14510  df-mopn 14511  df-top 14672  df-topon 14685  df-bases 14717  df-ntr 14770  df-limced 15330  df-dvap 15331
This theorem is referenced by:  dvcl  15357  dvfgg  15362  dvidlemap  15365  dvidrelem  15366  dvidsslem  15367  dvcnp2cntop  15373  dvaddxxbr  15375  dvmulxxbr  15376  dvcoapbr  15381  dvcjbr  15382  dvrecap  15387  dveflem  15400
  Copyright terms: Public domain W3C validator