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

Theorem climge0 11721
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 11720 . . . . . . . . 9  |-  ( ph  ->  A  e.  RR )
76adantr 276 . . . . . . . 8  |-  ( (
ph  /\  A  <  0 )  ->  A  e.  RR )
87renegcld 8482 . . . . . . 7  |-  ( (
ph  /\  A  <  0 )  ->  -u A  e.  RR )
96lt0neg1d 8618 . . . . . . . 8  |-  ( ph  ->  ( A  <  0  <->  0  <  -u A ) )
109biimpa 296 . . . . . . 7  |-  ( (
ph  /\  A  <  0 )  ->  0  <  -u A )
118, 10elrpd 9845 . . . . . 6  |-  ( (
ph  /\  A  <  0 )  ->  -u A  e.  RR+ )
12 eqidd 2207 . . . . . 6  |-  ( ( ( ph  /\  A  <  0 )  /\  k  e.  Z )  ->  ( F `  k )  =  ( F `  k ) )
134adantr 276 . . . . . 6  |-  ( (
ph  /\  A  <  0 )  ->  F  ~~>  A )
141, 3, 11, 12, 13climi2 11684 . . . . 5  |-  ( (
ph  /\  A  <  0 )  ->  E. j  e.  Z  A. k  e.  ( ZZ>= `  j )
( abs `  (
( F `  k
)  -  A ) )  <  -u A
)
151r19.2uz 11389 . . . . 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 11574 . . . . . . . 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 8131 . . . . . . 7  |-  ( ( ( ph  /\  A  <  0 )  /\  (
k  e.  Z  /\  ( abs `  ( ( F `  k )  -  A ) )  <  -u A ) )  ->  A  e.  CC )
2524negidd 8403 . . . . . 6  |-  ( ( ( ph  /\  A  <  0 )  /\  (
k  e.  Z  /\  ( abs `  ( ( F `  k )  -  A ) )  <  -u A ) )  ->  ( A  +  -u A )  =  0 )
2623, 25breqtrd 4080 . . . . 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 8103 . . . . . . 7  |-  ( ( ( ph  /\  A  <  0 )  /\  (
k  e.  Z  /\  ( abs `  ( ( F `  k )  -  A ) )  <  -u A ) )  ->  0  e.  RR )
3029, 18lenltd 8220 . . . . . 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 1393 . . . 4  |-  ( ( ( ph  /\  A  <  0 )  /\  (
k  e.  Z  /\  ( abs `  ( ( F `  k )  -  A ) )  <  -u A ) )  -> F.  )
3316, 32rexlimddv 2629 . . 3  |-  ( (
ph  /\  A  <  0 )  -> F.  )
3433inegd 1392 . 2  |-  ( ph  ->  -.  A  <  0
)
35 0re 8102 . . 3  |-  0  e.  RR
36 lenlt 8178 . . 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 1373   F. wfal 1378    e. wcel 2177   A.wral 2485   E.wrex 2486   class class class wbr 4054   ` cfv 5285  (class class class)co 5962   RRcr 7954   0cc0 7955    + caddc 7958    < clt 8137    <_ cle 8138    - cmin 8273   -ucneg 8274   ZZcz 9402   ZZ>=cuz 9678   abscabs 11393    ~~> cli 11674
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-coll 4170  ax-sep 4173  ax-nul 4181  ax-pow 4229  ax-pr 4264  ax-un 4493  ax-setind 4598  ax-iinf 4649  ax-cnex 8046  ax-resscn 8047  ax-1cn 8048  ax-1re 8049  ax-icn 8050  ax-addcl 8051  ax-addrcl 8052  ax-mulcl 8053  ax-mulrcl 8054  ax-addcom 8055  ax-mulcom 8056  ax-addass 8057  ax-mulass 8058  ax-distr 8059  ax-i2m1 8060  ax-0lt1 8061  ax-1rid 8062  ax-0id 8063  ax-rnegex 8064  ax-precex 8065  ax-cnre 8066  ax-pre-ltirr 8067  ax-pre-ltwlin 8068  ax-pre-lttrn 8069  ax-pre-apti 8070  ax-pre-ltadd 8071  ax-pre-mulgt0 8072  ax-pre-mulext 8073  ax-arch 8074  ax-caucvg 8075
This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-nel 2473  df-ral 2490  df-rex 2491  df-reu 2492  df-rmo 2493  df-rab 2494  df-v 2775  df-sbc 3003  df-csb 3098  df-dif 3172  df-un 3174  df-in 3176  df-ss 3183  df-nul 3465  df-if 3576  df-pw 3623  df-sn 3644  df-pr 3645  df-op 3647  df-uni 3860  df-int 3895  df-iun 3938  df-br 4055  df-opab 4117  df-mpt 4118  df-tr 4154  df-id 4353  df-po 4356  df-iso 4357  df-iord 4426  df-on 4428  df-ilim 4429  df-suc 4431  df-iom 4652  df-xp 4694  df-rel 4695  df-cnv 4696  df-co 4697  df-dm 4698  df-rn 4699  df-res 4700  df-ima 4701  df-iota 5246  df-fun 5287  df-fn 5288  df-f 5289  df-f1 5290  df-fo 5291  df-f1o 5292  df-fv 5293  df-riota 5917  df-ov 5965  df-oprab 5966  df-mpo 5967  df-1st 6244  df-2nd 6245  df-recs 6409  df-frec 6495  df-pnf 8139  df-mnf 8140  df-xr 8141  df-ltxr 8142  df-le 8143  df-sub 8275  df-neg 8276  df-reap 8678  df-ap 8685  df-div 8776  df-inn 9067  df-2 9125  df-3 9126  df-4 9127  df-n0 9326  df-z 9403  df-uz 9679  df-rp 9806  df-seqfrec 10625  df-exp 10716  df-cj 11238  df-re 11239  df-im 11240  df-rsqrt 11394  df-abs 11395  df-clim 11675
This theorem is referenced by:  climle  11730
  Copyright terms: Public domain W3C validator