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

Theorem resqrexlemgt0 11786
Description: Lemma for resqrex 11792. A limit is nonnegative. (Contributed by Jim Kingdon, 7-Aug-2021.)
Hypotheses
Ref Expression
resqrexlemex.seq  |-  F  =  seq 1 ( ( y  e.  RR+ ,  z  e.  RR+  |->  ( ( y  +  ( A  /  y ) )  /  2 ) ) ,  ( NN  X.  { ( 1  +  A ) } ) )
resqrexlemex.a  |-  ( ph  ->  A  e.  RR )
resqrexlemex.agt0  |-  ( ph  ->  0  <_  A )
resqrexlemgt0.rr  |-  ( ph  ->  L  e.  RR )
resqrexlemgt0.lim  |-  ( ph  ->  A. e  e.  RR+  E. j  e.  NN  A. i  e.  ( ZZ>= `  j ) ( ( F `  i )  <  ( L  +  e )  /\  L  <  ( ( F `  i )  +  e ) ) )
Assertion
Ref Expression
resqrexlemgt0  |-  ( ph  ->  0  <_  L )
Distinct variable groups:    y, A, z   
e, F    e, L, i, j    ph, i, j   
z, j, ph    ph, y
Allowed substitution hints:    ph( e)    A( e,  i,  j)    F( y,  z,  i,  j)    L( y,  z)

Proof of Theorem resqrexlemgt0
StepHypRef Expression
1 oveq2 6093 . . . . . . . . 9  |-  ( e  =  -u L  ->  ( L  +  e )  =  ( L  +  -u L ) )
21breq2d 4142 . . . . . . . 8  |-  ( e  =  -u L  ->  (
( F `  i
)  <  ( L  +  e )  <->  ( F `  i )  <  ( L  +  -u L ) ) )
3 oveq2 6093 . . . . . . . . 9  |-  ( e  =  -u L  ->  (
( F `  i
)  +  e )  =  ( ( F `
 i )  + 
-u L ) )
43breq2d 4142 . . . . . . . 8  |-  ( e  =  -u L  ->  ( L  <  ( ( F `
 i )  +  e )  <->  L  <  ( ( F `  i
)  +  -u L
) ) )
52, 4anbi12d 477 . . . . . . 7  |-  ( e  =  -u L  ->  (
( ( F `  i )  <  ( L  +  e )  /\  L  <  ( ( F `  i )  +  e ) )  <-> 
( ( F `  i )  <  ( L  +  -u L )  /\  L  <  (
( F `  i
)  +  -u L
) ) ) )
65rexralbidv 2576 . . . . . 6  |-  ( e  =  -u L  ->  ( E. j  e.  NN  A. i  e.  ( ZZ>= `  j ) ( ( F `  i )  <  ( L  +  e )  /\  L  <  ( ( F `  i )  +  e ) )  <->  E. j  e.  NN  A. i  e.  ( ZZ>= `  j )
( ( F `  i )  <  ( L  +  -u L )  /\  L  <  (
( F `  i
)  +  -u L
) ) ) )
7 resqrexlemgt0.lim . . . . . . 7  |-  ( ph  ->  A. e  e.  RR+  E. j  e.  NN  A. i  e.  ( ZZ>= `  j ) ( ( F `  i )  <  ( L  +  e )  /\  L  <  ( ( F `  i )  +  e ) ) )
87adantr 276 . . . . . 6  |-  ( (
ph  /\  L  <  0 )  ->  A. e  e.  RR+  E. j  e.  NN  A. i  e.  ( ZZ>= `  j )
( ( F `  i )  <  ( L  +  e )  /\  L  <  ( ( F `  i )  +  e ) ) )
9 resqrexlemgt0.rr . . . . . . . . 9  |-  ( ph  ->  L  e.  RR )
109adantr 276 . . . . . . . 8  |-  ( (
ph  /\  L  <  0 )  ->  L  e.  RR )
1110renegcld 8707 . . . . . . 7  |-  ( (
ph  /\  L  <  0 )  ->  -u L  e.  RR )
129lt0neg1d 8843 . . . . . . . 8  |-  ( ph  ->  ( L  <  0  <->  0  <  -u L ) )
1312biimpa 296 . . . . . . 7  |-  ( (
ph  /\  L  <  0 )  ->  0  <  -u L )
1411, 13elrpd 10094 . . . . . 6  |-  ( (
ph  /\  L  <  0 )  ->  -u L  e.  RR+ )
156, 8, 14rspcdva 2934 . . . . 5  |-  ( (
ph  /\  L  <  0 )  ->  E. j  e.  NN  A. i  e.  ( ZZ>= `  j )
( ( F `  i )  <  ( L  +  -u L )  /\  L  <  (
( F `  i
)  +  -u L
) ) )
16 simpl 109 . . . . . . . 8  |-  ( ( ( F `  i
)  <  ( L  +  -u L )  /\  L  <  ( ( F `
 i )  + 
-u L ) )  ->  ( F `  i )  <  ( L  +  -u L ) )
1710recnd 8354 . . . . . . . . . 10  |-  ( (
ph  /\  L  <  0 )  ->  L  e.  CC )
1817negidd 8627 . . . . . . . . 9  |-  ( (
ph  /\  L  <  0 )  ->  ( L  +  -u L )  =  0 )
1918breq2d 4142 . . . . . . . 8  |-  ( (
ph  /\  L  <  0 )  ->  (
( F `  i
)  <  ( L  +  -u L )  <->  ( F `  i )  <  0
) )
2016, 19imbitrid 154 . . . . . . 7  |-  ( (
ph  /\  L  <  0 )  ->  (
( ( F `  i )  <  ( L  +  -u L )  /\  L  <  (
( F `  i
)  +  -u L
) )  ->  ( F `  i )  <  0 ) )
2120ralimdv 2618 . . . . . 6  |-  ( (
ph  /\  L  <  0 )  ->  ( A. i  e.  ( ZZ>=
`  j ) ( ( F `  i
)  <  ( L  +  -u L )  /\  L  <  ( ( F `
 i )  + 
-u L ) )  ->  A. i  e.  (
ZZ>= `  j ) ( F `  i )  <  0 ) )
2221reximdv 2651 . . . . 5  |-  ( (
ph  /\  L  <  0 )  ->  ( E. j  e.  NN  A. i  e.  ( ZZ>= `  j ) ( ( F `  i )  <  ( L  +  -u L )  /\  L  <  ( ( F `  i )  +  -u L ) )  ->  E. j  e.  NN  A. i  e.  ( ZZ>= `  j ) ( F `
 i )  <  0 ) )
2315, 22mpd 13 . . . 4  |-  ( (
ph  /\  L  <  0 )  ->  E. j  e.  NN  A. i  e.  ( ZZ>= `  j )
( F `  i
)  <  0 )
24 0red 8327 . . . . . . . . . . 11  |-  ( (
ph  /\  ( j  e.  NN  /\  i  e.  ( ZZ>= `  j )
) )  ->  0  e.  RR )
25 eluznn 10000 . . . . . . . . . . . . 13  |-  ( ( j  e.  NN  /\  i  e.  ( ZZ>= `  j ) )  -> 
i  e.  NN )
26 resqrexlemex.seq . . . . . . . . . . . . . . 15  |-  F  =  seq 1 ( ( y  e.  RR+ ,  z  e.  RR+  |->  ( ( y  +  ( A  /  y ) )  /  2 ) ) ,  ( NN  X.  { ( 1  +  A ) } ) )
27 resqrexlemex.a . . . . . . . . . . . . . . 15  |-  ( ph  ->  A  e.  RR )
28 resqrexlemex.agt0 . . . . . . . . . . . . . . 15  |-  ( ph  ->  0  <_  A )
2926, 27, 28resqrexlemf 11773 . . . . . . . . . . . . . 14  |-  ( ph  ->  F : NN --> RR+ )
3029ffvelcdmda 5843 . . . . . . . . . . . . 13  |-  ( (
ph  /\  i  e.  NN )  ->  ( F `
 i )  e.  RR+ )
3125, 30sylan2 286 . . . . . . . . . . . 12  |-  ( (
ph  /\  ( j  e.  NN  /\  i  e.  ( ZZ>= `  j )
) )  ->  ( F `  i )  e.  RR+ )
3231rpred 10097 . . . . . . . . . . 11  |-  ( (
ph  /\  ( j  e.  NN  /\  i  e.  ( ZZ>= `  j )
) )  ->  ( F `  i )  e.  RR )
3331rpgt0d 10100 . . . . . . . . . . 11  |-  ( (
ph  /\  ( j  e.  NN  /\  i  e.  ( ZZ>= `  j )
) )  ->  0  <  ( F `  i
) )
3424, 32, 33ltnsymd 8446 . . . . . . . . . 10  |-  ( (
ph  /\  ( j  e.  NN  /\  i  e.  ( ZZ>= `  j )
) )  ->  -.  ( F `  i )  <  0 )
3534pm2.21d 628 . . . . . . . . 9  |-  ( (
ph  /\  ( j  e.  NN  /\  i  e.  ( ZZ>= `  j )
) )  ->  (
( F `  i
)  <  0  -> F.  ) )
3635anassrs 404 . . . . . . . 8  |-  ( ( ( ph  /\  j  e.  NN )  /\  i  e.  ( ZZ>= `  j )
)  ->  ( ( F `  i )  <  0  -> F.  )
)
3736ralimdva 2617 . . . . . . 7  |-  ( (
ph  /\  j  e.  NN )  ->  ( A. i  e.  ( ZZ>= `  j ) ( F `
 i )  <  0  ->  A. i  e.  ( ZZ>= `  j ) F.  ) )
38 nnz 9663 . . . . . . . . 9  |-  ( j  e.  NN  ->  j  e.  ZZ )
39 uzid 9936 . . . . . . . . . 10  |-  ( j  e.  ZZ  ->  j  e.  ( ZZ>= `  j )
)
40 elex2 2838 . . . . . . . . . 10  |-  ( j  e.  ( ZZ>= `  j
)  ->  E. z 
z  e.  ( ZZ>= `  j ) )
41 r19.3rmv 3618 . . . . . . . . . 10  |-  ( E. z  z  e.  (
ZZ>= `  j )  -> 
( F.  <->  A. i  e.  ( ZZ>= `  j ) F.  ) )
4239, 40, 413syl 17 . . . . . . . . 9  |-  ( j  e.  ZZ  ->  ( F. 
<-> 
A. i  e.  (
ZZ>= `  j ) F.  ) )
4338, 42syl 14 . . . . . . . 8  |-  ( j  e.  NN  ->  ( F. 
<-> 
A. i  e.  (
ZZ>= `  j ) F.  ) )
4443adantl 277 . . . . . . 7  |-  ( (
ph  /\  j  e.  NN )  ->  ( F.  <->  A. i  e.  ( ZZ>=
`  j ) F.  ) )
4537, 44sylibrd 169 . . . . . 6  |-  ( (
ph  /\  j  e.  NN )  ->  ( A. i  e.  ( ZZ>= `  j ) ( F `
 i )  <  0  -> F.  )
)
4645rexlimdva 2668 . . . . 5  |-  ( ph  ->  ( E. j  e.  NN  A. i  e.  ( ZZ>= `  j )
( F `  i
)  <  0  -> F.  ) )
4746adantr 276 . . . 4  |-  ( (
ph  /\  L  <  0 )  ->  ( E. j  e.  NN  A. i  e.  ( ZZ>= `  j ) ( F `
 i )  <  0  -> F.  )
)
4823, 47mpd 13 . . 3  |-  ( (
ph  /\  L  <  0 )  -> F.  )
4948inegd 1421 . 2  |-  ( ph  ->  -.  L  <  0
)
50 0re 8326 . . 3  |-  0  e.  RR
51 lenlt 8401 . . 3  |-  ( ( 0  e.  RR  /\  L  e.  RR )  ->  ( 0  <_  L  <->  -.  L  <  0 ) )
5250, 9, 51sylancr 418 . 2  |-  ( ph  ->  ( 0  <_  L  <->  -.  L  <  0 ) )
5349, 52mpbird 167 1  |-  ( ph  ->  0  <_  L )
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.wex 1545    e. wcel 2209   A.wral 2528   E.wrex 2529   {csn 3709   class class class wbr 4130    X. cxp 4772   ` cfv 5377  (class class class)co 6085    e. cmpo 6087   RRcr 8178   0cc0 8179   1c1 8180    + caddc 8182    < clt 8360    <_ cle 8361   -ucneg 8498    / cdiv 9002   NNcn 9304   2c2 9355   ZZcz 9644   ZZ>=cuz 9921   RR+crp 10054    seqcseq 10884
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
This proof depends on definitions:  df-bi 117  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-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-n0 9564  df-z 9645  df-uz 9922  df-rp 10055  df-seqfrec 10885
This theorem is used by:  resqrexlemglsq  11788  resqrexlemex  11791
  Copyright terms: Public domain W3C validator