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

Theorem climge0 11490
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 11489 . . . . . . . . 9  |-  ( ph  ->  A  e.  RR )
76adantr 276 . . . . . . . 8  |-  ( (
ph  /\  A  <  0 )  ->  A  e.  RR )
87renegcld 8406 . . . . . . 7  |-  ( (
ph  /\  A  <  0 )  ->  -u A  e.  RR )
96lt0neg1d 8542 . . . . . . . 8  |-  ( ph  ->  ( A  <  0  <->  0  <  -u A ) )
109biimpa 296 . . . . . . 7  |-  ( (
ph  /\  A  <  0 )  ->  0  <  -u A )
118, 10elrpd 9768 . . . . . 6  |-  ( (
ph  /\  A  <  0 )  ->  -u A  e.  RR+ )
12 eqidd 2197 . . . . . 6  |-  ( ( ( ph  /\  A  <  0 )  /\  k  e.  Z )  ->  ( F `  k )  =  ( F `  k ) )
134adantr 276 . . . . . 6  |-  ( (
ph  /\  A  <  0 )  ->  F  ~~>  A )
141, 3, 11, 12, 13climi2 11453 . . . . 5  |-  ( (
ph  /\  A  <  0 )  ->  E. j  e.  Z  A. k  e.  ( ZZ>= `  j )
( abs `  (
( F `  k
)  -  A ) )  <  -u A
)
151r19.2uz 11158 . . . . 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 531 . . . . . . . 8  |-  ( ( ( ph  /\  A  <  0 )  /\  (
k  e.  Z  /\  ( abs `  ( ( F `  k )  -  A ) )  <  -u A ) )  ->  ( abs `  (
( F `  k
)  -  A ) )  <  -u A
)
185ad2ant2r 509 . . . . . . . . 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 11343 . . . . . . . 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 8055 . . . . . . 7  |-  ( ( ( ph  /\  A  <  0 )  /\  (
k  e.  Z  /\  ( abs `  ( ( F `  k )  -  A ) )  <  -u A ) )  ->  A  e.  CC )
2524negidd 8327 . . . . . 6  |-  ( ( ( ph  /\  A  <  0 )  /\  (
k  e.  Z  /\  ( abs `  ( ( F `  k )  -  A ) )  <  -u A ) )  ->  ( A  +  -u A )  =  0 )
2623, 25breqtrd 4059 . . . . 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 509 . . . . . 6  |-  ( ( ( ph  /\  A  <  0 )  /\  (
k  e.  Z  /\  ( abs `  ( ( F `  k )  -  A ) )  <  -u A ) )  ->  0  <_  ( F `  k )
)
29 0red 8027 . . . . . . 7  |-  ( ( ( ph  /\  A  <  0 )  /\  (
k  e.  Z  /\  ( abs `  ( ( F `  k )  -  A ) )  <  -u A ) )  ->  0  e.  RR )
3029, 18lenltd 8144 . . . . . 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 1384 . . . 4  |-  ( ( ( ph  /\  A  <  0 )  /\  (
k  e.  Z  /\  ( abs `  ( ( F `  k )  -  A ) )  <  -u A ) )  -> F.  )
3316, 32rexlimddv 2619 . . 3  |-  ( (
ph  /\  A  <  0 )  -> F.  )
3433inegd 1383 . 2  |-  ( ph  ->  -.  A  <  0
)
35 0re 8026 . . 3  |-  0  e.  RR
36 lenlt 8102 . . 3  |-  ( ( 0  e.  RR  /\  A  e.  RR )  ->  ( 0  <_  A  <->  -.  A  <  0 ) )
3735, 6, 36sylancr 414 . 2  |-  ( ph  ->  ( 0  <_  A  <->  -.  A  <  0 ) )
3834, 37mpbird 167 1  |-  ( ph  ->  0  <_  A )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1364   F. wfal 1369    e. wcel 2167   A.wral 2475   E.wrex 2476   class class class wbr 4033   ` cfv 5258  (class class class)co 5922   RRcr 7878   0cc0 7879    + caddc 7882    < clt 8061    <_ cle 8062    - cmin 8197   -ucneg 8198   ZZcz 9326   ZZ>=cuz 9601   abscabs 11162    ~~> cli 11443
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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4148  ax-sep 4151  ax-nul 4159  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-setind 4573  ax-iinf 4624  ax-cnex 7970  ax-resscn 7971  ax-1cn 7972  ax-1re 7973  ax-icn 7974  ax-addcl 7975  ax-addrcl 7976  ax-mulcl 7977  ax-mulrcl 7978  ax-addcom 7979  ax-mulcom 7980  ax-addass 7981  ax-mulass 7982  ax-distr 7983  ax-i2m1 7984  ax-0lt1 7985  ax-1rid 7986  ax-0id 7987  ax-rnegex 7988  ax-precex 7989  ax-cnre 7990  ax-pre-ltirr 7991  ax-pre-ltwlin 7992  ax-pre-lttrn 7993  ax-pre-apti 7994  ax-pre-ltadd 7995  ax-pre-mulgt0 7996  ax-pre-mulext 7997  ax-arch 7998  ax-caucvg 7999
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3451  df-if 3562  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-int 3875  df-iun 3918  df-br 4034  df-opab 4095  df-mpt 4096  df-tr 4132  df-id 4328  df-po 4331  df-iso 4332  df-iord 4401  df-on 4403  df-ilim 4404  df-suc 4406  df-iom 4627  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fun 5260  df-fn 5261  df-f 5262  df-f1 5263  df-fo 5264  df-f1o 5265  df-fv 5266  df-riota 5877  df-ov 5925  df-oprab 5926  df-mpo 5927  df-1st 6198  df-2nd 6199  df-recs 6363  df-frec 6449  df-pnf 8063  df-mnf 8064  df-xr 8065  df-ltxr 8066  df-le 8067  df-sub 8199  df-neg 8200  df-reap 8602  df-ap 8609  df-div 8700  df-inn 8991  df-2 9049  df-3 9050  df-4 9051  df-n0 9250  df-z 9327  df-uz 9602  df-rp 9729  df-seqfrec 10540  df-exp 10631  df-cj 11007  df-re 11008  df-im 11009  df-rsqrt 11163  df-abs 11164  df-clim 11444
This theorem is referenced by:  climle  11499
  Copyright terms: Public domain W3C validator