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

Theorem resqrexlemgt0 11705
Description: Lemma for resqrex 11711. 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 6058 . . . . . . . . 9  |-  ( e  =  -u L  ->  ( L  +  e )  =  ( L  +  -u L ) )
21breq2d 4121 . . . . . . . 8  |-  ( e  =  -u L  ->  (
( F `  i
)  <  ( L  +  e )  <->  ( F `  i )  <  ( L  +  -u L ) ) )
3 oveq2 6058 . . . . . . . . 9  |-  ( e  =  -u L  ->  (
( F `  i
)  +  e )  =  ( ( F `
 i )  + 
-u L ) )
43breq2d 4121 . . . . . . . 8  |-  ( e  =  -u L  ->  ( L  <  ( ( F `
 i )  +  e )  <->  L  <  ( ( F `  i
)  +  -u L
) ) )
52, 4anbi12d 473 . . . . . . 7  |-  ( e  =  -u L  ->  (
( ( F `  i )  <  ( L  +  e )  /\  L  <  ( ( F `  i )  +  e ) )  <-> 
( ( F `  i )  <  ( L  +  -u L )  /\  L  <  (
( F `  i
)  +  -u L
) ) ) )
65rexralbidv 2568 . . . . . 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 8653 . . . . . . 7  |-  ( (
ph  /\  L  <  0 )  ->  -u L  e.  RR )
129lt0neg1d 8789 . . . . . . . 8  |-  ( ph  ->  ( L  <  0  <->  0  <  -u L ) )
1312biimpa 296 . . . . . . 7  |-  ( (
ph  /\  L  <  0 )  ->  0  <  -u L )
1411, 13elrpd 10026 . . . . . 6  |-  ( (
ph  /\  L  <  0 )  ->  -u L  e.  RR+ )
156, 8, 14rspcdva 2926 . . . . 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 8302 . . . . . . . . . 10  |-  ( (
ph  /\  L  <  0 )  ->  L  e.  CC )
1817negidd 8574 . . . . . . . . 9  |-  ( (
ph  /\  L  <  0 )  ->  ( L  +  -u L )  =  0 )
1918breq2d 4121 . . . . . . . 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 2610 . . . . . 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 2643 . . . . 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 8275 . . . . . . . . . . 11  |-  ( (
ph  /\  ( j  e.  NN  /\  i  e.  ( ZZ>= `  j )
) )  ->  0  e.  RR )
25 eluznn 9932 . . . . . . . . . . . . 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 11692 . . . . . . . . . . . . . 14  |-  ( ph  ->  F : NN --> RR+ )
3029ffvelcdmda 5812 . . . . . . . . . . . . 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 10029 . . . . . . . . . . 11  |-  ( (
ph  /\  ( j  e.  NN  /\  i  e.  ( ZZ>= `  j )
) )  ->  ( F `  i )  e.  RR )
3331rpgt0d 10032 . . . . . . . . . . 11  |-  ( (
ph  /\  ( j  e.  NN  /\  i  e.  ( ZZ>= `  j )
) )  ->  0  <  ( F `  i
) )
3424, 32, 33ltnsymd 8393 . . . . . . . . . 10  |-  ( (
ph  /\  ( j  e.  NN  /\  i  e.  ( ZZ>= `  j )
) )  ->  -.  ( F `  i )  <  0 )
3534pm2.21d 624 . . . . . . . . 9  |-  ( (
ph  /\  ( j  e.  NN  /\  i  e.  ( ZZ>= `  j )
) )  ->  (
( F `  i
)  <  0  -> F.  ) )
3635anassrs 400 . . . . . . . 8  |-  ( ( ( ph  /\  j  e.  NN )  /\  i  e.  ( ZZ>= `  j )
)  ->  ( ( F `  i )  <  0  -> F.  )
)
3736ralimdva 2609 . . . . . . 7  |-  ( (
ph  /\  j  e.  NN )  ->  ( A. i  e.  ( ZZ>= `  j ) ( F `
 i )  <  0  ->  A. i  e.  ( ZZ>= `  j ) F.  ) )
38 nnz 9596 . . . . . . . . 9  |-  ( j  e.  NN  ->  j  e.  ZZ )
39 uzid 9868 . . . . . . . . . 10  |-  ( j  e.  ZZ  ->  j  e.  ( ZZ>= `  j )
)
40 elex2 2830 . . . . . . . . . 10  |-  ( j  e.  ( ZZ>= `  j
)  ->  E. z 
z  e.  ( ZZ>= `  j ) )
41 r19.3rmv 3600 . . . . . . . . . 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 2660 . . . . 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 1417 . 2  |-  ( ph  ->  -.  L  <  0
)
50 0re 8274 . . 3  |-  0  e.  RR
51 lenlt 8349 . . 3  |-  ( ( 0  e.  RR  /\  L  e.  RR )  ->  ( 0  <_  L  <->  -.  L  <  0 ) )
5250, 9, 51sylancr 414 . 2  |-  ( ph  ->  ( 0  <_  L  <->  -.  L  <  0 ) )
5349, 52mpbird 167 1  |-  ( ph  ->  0  <_  L )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398   F. wfal 1403   E.wex 1541    e. wcel 2203   A.wral 2520   E.wrex 2521   {csn 3689   class class class wbr 4109    X. cxp 4747   ` cfv 5352  (class class class)co 6050    e. cmpo 6052   RRcr 8126   0cc0 8127   1c1 8128    + caddc 8130    < clt 8308    <_ cle 8309   -ucneg 8445    / cdiv 8946   NNcn 9237   2c2 9288   ZZcz 9577   ZZ>=cuz 9853   RR+crp 9986    seqcseq 10809
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-nul 4236  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-iinf 4710  ax-cnex 8218  ax-resscn 8219  ax-1cn 8220  ax-1re 8221  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-mulrcl 8226  ax-addcom 8227  ax-mulcom 8228  ax-addass 8229  ax-mulass 8230  ax-distr 8231  ax-i2m1 8232  ax-0lt1 8233  ax-1rid 8234  ax-0id 8235  ax-rnegex 8236  ax-precex 8237  ax-cnre 8238  ax-pre-ltirr 8239  ax-pre-ltwlin 8240  ax-pre-lttrn 8241  ax-pre-apti 8242  ax-pre-ltadd 8243  ax-pre-mulgt0 8244  ax-pre-mulext 8245
This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rmo 2528  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-tr 4209  df-id 4414  df-po 4417  df-iso 4418  df-iord 4487  df-on 4489  df-ilim 4490  df-suc 4492  df-iom 4713  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-1st 6334  df-2nd 6335  df-recs 6536  df-frec 6622  df-pnf 8310  df-mnf 8311  df-xr 8312  df-ltxr 8313  df-le 8314  df-sub 8446  df-neg 8447  df-reap 8849  df-ap 8856  df-div 8947  df-inn 9238  df-2 9296  df-n0 9497  df-z 9578  df-uz 9854  df-rp 9987  df-seqfrec 10810
This theorem is referenced by:  resqrexlemglsq  11707  resqrexlemex  11710
  Copyright terms: Public domain W3C validator