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

Theorem climge0 12091
Description: A nonnegative sequence converges to a nonnegative number. (Contributed by NM, 11-Sep-2005.)
Hypotheses
Ref Expression
climrecl.1  |-  Z  =  ( ZZ>= `  M )
climrecl.2  |-  ( ph  ->  M  e.  ZZ )
climrecl.3  |-  ( ph  ->  F  ~~>  A )
climrecl.4  |-  ( (
ph  /\  k  e.  Z )  ->  ( F `  k )  e.  RR )
climge0.5  |-  ( (
ph  /\  k  e.  Z )  ->  0  <_  ( F `  k
) )
Assertion
Ref Expression
climge0  |-  ( ph  ->  0  <_  A )
Distinct variable groups:    k, F    k, M    ph, k    k, Z    A, k

Proof of Theorem climge0
Dummy variable  j is distinct from all other variables.
StepHypRef Expression
1 climrecl.1 . . . . . 6  |-  Z  =  ( ZZ>= `  M )
2 climrecl.2 . . . . . . 7  |-  ( ph  ->  M  e.  ZZ )
32adantr 276 . . . . . 6  |-  ( (
ph  /\  A  <  0 )  ->  M  e.  ZZ )
4 climrecl.3 . . . . . . . . . 10  |-  ( ph  ->  F  ~~>  A )
5 climrecl.4 . . . . . . . . . 10  |-  ( (
ph  /\  k  e.  Z )  ->  ( F `  k )  e.  RR )
61, 2, 4, 5climrecl 12090 . . . . . . . . 9  |-  ( ph  ->  A  e.  RR )
76adantr 276 . . . . . . . 8  |-  ( (
ph  /\  A  <  0 )  ->  A  e.  RR )
87renegcld 8707 . . . . . . 7  |-  ( (
ph  /\  A  <  0 )  ->  -u A  e.  RR )
96lt0neg1d 8843 . . . . . . . 8  |-  ( ph  ->  ( A  <  0  <->  0  <  -u A ) )
109biimpa 296 . . . . . . 7  |-  ( (
ph  /\  A  <  0 )  ->  0  <  -u A )
118, 10elrpd 10094 . . . . . 6  |-  ( (
ph  /\  A  <  0 )  ->  -u A  e.  RR+ )
12 eqidd 2239 . . . . . 6  |-  ( ( ( ph  /\  A  <  0 )  /\  k  e.  Z )  ->  ( F `  k )  =  ( F `  k ) )
134adantr 276 . . . . . 6  |-  ( (
ph  /\  A  <  0 )  ->  F  ~~>  A )
141, 3, 11, 12, 13climi2 12054 . . . . 5  |-  ( (
ph  /\  A  <  0 )  ->  E. j  e.  Z  A. k  e.  ( ZZ>= `  j )
( abs `  (
( F `  k
)  -  A ) )  <  -u A
)
151r19.2uz 11759 . . . . 5  |-  ( E. j  e.  Z  A. k  e.  ( ZZ>= `  j ) ( abs `  ( ( F `  k )  -  A
) )  <  -u A  ->  E. k  e.  Z  ( abs `  ( ( F `  k )  -  A ) )  <  -u A )
1614, 15syl 14 . . . 4  |-  ( (
ph  /\  A  <  0 )  ->  E. k  e.  Z  ( abs `  ( ( F `  k )  -  A
) )  <  -u A
)
17 simprr 537 . . . . . . . 8  |-  ( ( ( ph  /\  A  <  0 )  /\  (
k  e.  Z  /\  ( abs `  ( ( F `  k )  -  A ) )  <  -u A ) )  ->  ( abs `  (
( F `  k
)  -  A ) )  <  -u A
)
185ad2ant2r 513 . . . . . . . . 9  |-  ( ( ( ph  /\  A  <  0 )  /\  (
k  e.  Z  /\  ( abs `  ( ( F `  k )  -  A ) )  <  -u A ) )  ->  ( F `  k )  e.  RR )
197adantr 276 . . . . . . . . 9  |-  ( ( ( ph  /\  A  <  0 )  /\  (
k  e.  Z  /\  ( abs `  ( ( F `  k )  -  A ) )  <  -u A ) )  ->  A  e.  RR )
208adantr 276 . . . . . . . . 9  |-  ( ( ( ph  /\  A  <  0 )  /\  (
k  e.  Z  /\  ( abs `  ( ( F `  k )  -  A ) )  <  -u A ) )  ->  -u A  e.  RR )
2118, 19, 20absdifltd 11944 . . . . . . . 8  |-  ( ( ( ph  /\  A  <  0 )  /\  (
k  e.  Z  /\  ( abs `  ( ( F `  k )  -  A ) )  <  -u A ) )  ->  ( ( abs `  ( ( F `  k )  -  A
) )  <  -u A  <->  ( ( A  -  -u A
)  <  ( F `  k )  /\  ( F `  k )  <  ( A  +  -u A ) ) ) )
2217, 21mpbid 147 . . . . . . 7  |-  ( ( ( ph  /\  A  <  0 )  /\  (
k  e.  Z  /\  ( abs `  ( ( F `  k )  -  A ) )  <  -u A ) )  ->  ( ( A  -  -u A )  < 
( F `  k
)  /\  ( F `  k )  <  ( A  +  -u A ) ) )
2322simprd 114 . . . . . 6  |-  ( ( ( ph  /\  A  <  0 )  /\  (
k  e.  Z  /\  ( abs `  ( ( F `  k )  -  A ) )  <  -u A ) )  ->  ( F `  k )  <  ( A  +  -u A ) )
2419recnd 8354 . . . . . . 7  |-  ( ( ( ph  /\  A  <  0 )  /\  (
k  e.  Z  /\  ( abs `  ( ( F `  k )  -  A ) )  <  -u A ) )  ->  A  e.  CC )
2524negidd 8627 . . . . . 6  |-  ( ( ( ph  /\  A  <  0 )  /\  (
k  e.  Z  /\  ( abs `  ( ( F `  k )  -  A ) )  <  -u A ) )  ->  ( A  +  -u A )  =  0 )
2623, 25breqtrd 4156 . . . . 5  |-  ( ( ( ph  /\  A  <  0 )  /\  (
k  e.  Z  /\  ( abs `  ( ( F `  k )  -  A ) )  <  -u A ) )  ->  ( F `  k )  <  0
)
27 climge0.5 . . . . . . 7  |-  ( (
ph  /\  k  e.  Z )  ->  0  <_  ( F `  k
) )
2827ad2ant2r 513 . . . . . 6  |-  ( ( ( ph  /\  A  <  0 )  /\  (
k  e.  Z  /\  ( abs `  ( ( F `  k )  -  A ) )  <  -u A ) )  ->  0  <_  ( F `  k )
)
29 0red 8327 . . . . . . 7  |-  ( ( ( ph  /\  A  <  0 )  /\  (
k  e.  Z  /\  ( abs `  ( ( F `  k )  -  A ) )  <  -u A ) )  ->  0  e.  RR )
3029, 18lenltd 8444 . . . . . 6  |-  ( ( ( ph  /\  A  <  0 )  /\  (
k  e.  Z  /\  ( abs `  ( ( F `  k )  -  A ) )  <  -u A ) )  ->  ( 0  <_ 
( F `  k
)  <->  -.  ( F `  k )  <  0
) )
3128, 30mpbid 147 . . . . 5  |-  ( ( ( ph  /\  A  <  0 )  /\  (
k  e.  Z  /\  ( abs `  ( ( F `  k )  -  A ) )  <  -u A ) )  ->  -.  ( F `  k )  <  0
)
3226, 31pm2.21fal 1422 . . . 4  |-  ( ( ( ph  /\  A  <  0 )  /\  (
k  e.  Z  /\  ( abs `  ( ( F `  k )  -  A ) )  <  -u A ) )  -> F.  )
3316, 32rexlimddv 2673 . . 3  |-  ( (
ph  /\  A  <  0 )  -> F.  )
3433inegd 1421 . 2  |-  ( ph  ->  -.  A  <  0
)
35 0re 8326 . . 3  |-  0  e.  RR
36 lenlt 8401 . . 3  |-  ( ( 0  e.  RR  /\  A  e.  RR )  ->  ( 0  <_  A  <->  -.  A  <  0 ) )
3735, 6, 36sylancr 418 . 2  |-  ( ph  ->  ( 0  <_  A  <->  -.  A  <  0 ) )
3834, 37mpbird 167 1  |-  ( ph  ->  0  <_  A )
Colors of variables:    wff set class
This proof depends on syntax axioms:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402   F. wfal 1407    e. wcel 2209   A.wral 2528   E.wrex 2529   class class class wbr 4130   ` cfv 5377  (class class class)co 6085   RRcr 8178   0cc0 8179    + caddc 8182    < clt 8360    <_ cle 8361    - cmin 8497   -ucneg 8498   ZZcz 9644   ZZ>=cuz 9921   abscabs 11763    ~~> cli 12044
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-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297  ax-arch 8298  ax-caucvg 8299
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  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-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  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-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  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-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-frec 6662  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8903  df-ap 8910  df-div 9003  df-inn 9305  df-2 9363  df-3 9364  df-4 9365  df-n0 9564  df-z 9645  df-uz 9922  df-rp 10055  df-seqfrec 10885  df-exp 10976  df-cj 11607  df-re 11608  df-im 11609  df-rsqrt 11764  df-abs 11765  df-clim 12045
This theorem is used by:  climle  12100
  Copyright terms: Public domain W3C validator