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

Theorem resqrexlemnmsq 10959
Description: Lemma for resqrex 10968. The difference between the squares of two terms of the sequence. (Contributed by Mario Carneiro and Jim Kingdon, 30-Jul-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 )
resqrexlemnmsq.n  |-  ( ph  ->  N  e.  NN )
resqrexlemnmsq.m  |-  ( ph  ->  M  e.  NN )
resqrexlemnmsq.nm  |-  ( ph  ->  N  <_  M )
Assertion
Ref Expression
resqrexlemnmsq  |-  ( ph  ->  ( ( ( F `
 N ) ^
2 )  -  (
( F `  M
) ^ 2 ) )  <  ( ( ( F `  1
) ^ 2 )  /  ( 4 ^ ( N  -  1 ) ) ) )
Distinct variable groups:    y, A, z    ph, y, z    y, M, z    y, N, z
Allowed substitution hints:    F( y, z)

Proof of Theorem resqrexlemnmsq
StepHypRef Expression
1 resqrexlemex.seq . . . . . . . 8  |-  F  =  seq 1 ( ( y  e.  RR+ ,  z  e.  RR+  |->  ( ( y  +  ( A  /  y ) )  /  2 ) ) ,  ( NN  X.  { ( 1  +  A ) } ) )
2 resqrexlemex.a . . . . . . . 8  |-  ( ph  ->  A  e.  RR )
3 resqrexlemex.agt0 . . . . . . . 8  |-  ( ph  ->  0  <_  A )
41, 2, 3resqrexlemf 10949 . . . . . . 7  |-  ( ph  ->  F : NN --> RR+ )
5 resqrexlemnmsq.n . . . . . . 7  |-  ( ph  ->  N  e.  NN )
64, 5ffvelrnd 5621 . . . . . 6  |-  ( ph  ->  ( F `  N
)  e.  RR+ )
76rpred 9632 . . . . 5  |-  ( ph  ->  ( F `  N
)  e.  RR )
87resqcld 10614 . . . 4  |-  ( ph  ->  ( ( F `  N ) ^ 2 )  e.  RR )
98recnd 7927 . . 3  |-  ( ph  ->  ( ( F `  N ) ^ 2 )  e.  CC )
10 resqrexlemnmsq.m . . . . . . 7  |-  ( ph  ->  M  e.  NN )
114, 10ffvelrnd 5621 . . . . . 6  |-  ( ph  ->  ( F `  M
)  e.  RR+ )
1211rpred 9632 . . . . 5  |-  ( ph  ->  ( F `  M
)  e.  RR )
1312resqcld 10614 . . . 4  |-  ( ph  ->  ( ( F `  M ) ^ 2 )  e.  RR )
1413recnd 7927 . . 3  |-  ( ph  ->  ( ( F `  M ) ^ 2 )  e.  CC )
152recnd 7927 . . 3  |-  ( ph  ->  A  e.  CC )
169, 14, 15nnncan2d 8244 . 2  |-  ( ph  ->  ( ( ( ( F `  N ) ^ 2 )  -  A )  -  (
( ( F `  M ) ^ 2 )  -  A ) )  =  ( ( ( F `  N
) ^ 2 )  -  ( ( F `
 M ) ^
2 ) ) )
178, 2resubcld 8279 . . . 4  |-  ( ph  ->  ( ( ( F `
 N ) ^
2 )  -  A
)  e.  RR )
1813, 2resubcld 8279 . . . 4  |-  ( ph  ->  ( ( ( F `
 M ) ^
2 )  -  A
)  e.  RR )
1917, 18resubcld 8279 . . 3  |-  ( ph  ->  ( ( ( ( F `  N ) ^ 2 )  -  A )  -  (
( ( F `  M ) ^ 2 )  -  A ) )  e.  RR )
20 1nn 8868 . . . . . . . 8  |-  1  e.  NN
2120a1i 9 . . . . . . 7  |-  ( ph  ->  1  e.  NN )
224, 21ffvelrnd 5621 . . . . . 6  |-  ( ph  ->  ( F `  1
)  e.  RR+ )
23 2z 9219 . . . . . . 7  |-  2  e.  ZZ
2423a1i 9 . . . . . 6  |-  ( ph  ->  2  e.  ZZ )
2522, 24rpexpcld 10612 . . . . 5  |-  ( ph  ->  ( ( F ` 
1 ) ^ 2 )  e.  RR+ )
26 4nn 9020 . . . . . . . 8  |-  4  e.  NN
2726a1i 9 . . . . . . 7  |-  ( ph  ->  4  e.  NN )
2827nnrpd 9630 . . . . . 6  |-  ( ph  ->  4  e.  RR+ )
295nnzd 9312 . . . . . . 7  |-  ( ph  ->  N  e.  ZZ )
30 1zzd 9218 . . . . . . 7  |-  ( ph  ->  1  e.  ZZ )
3129, 30zsubcld 9318 . . . . . 6  |-  ( ph  ->  ( N  -  1 )  e.  ZZ )
3228, 31rpexpcld 10612 . . . . 5  |-  ( ph  ->  ( 4 ^ ( N  -  1 ) )  e.  RR+ )
3325, 32rpdivcld 9650 . . . 4  |-  ( ph  ->  ( ( ( F `
 1 ) ^
2 )  /  (
4 ^ ( N  -  1 ) ) )  e.  RR+ )
3433rpred 9632 . . 3  |-  ( ph  ->  ( ( ( F `
 1 ) ^
2 )  /  (
4 ^ ( N  -  1 ) ) )  e.  RR )
351, 2, 3resqrexlemover 10952 . . . . . 6  |-  ( (
ph  /\  M  e.  NN )  ->  A  < 
( ( F `  M ) ^ 2 ) )
3610, 35mpdan 418 . . . . 5  |-  ( ph  ->  A  <  ( ( F `  M ) ^ 2 ) )
37 difrp 9628 . . . . . 6  |-  ( ( A  e.  RR  /\  ( ( F `  M ) ^ 2 )  e.  RR )  ->  ( A  < 
( ( F `  M ) ^ 2 )  <->  ( ( ( F `  M ) ^ 2 )  -  A )  e.  RR+ ) )
382, 13, 37syl2anc 409 . . . . 5  |-  ( ph  ->  ( A  <  (
( F `  M
) ^ 2 )  <-> 
( ( ( F `
 M ) ^
2 )  -  A
)  e.  RR+ )
)
3936, 38mpbid 146 . . . 4  |-  ( ph  ->  ( ( ( F `
 M ) ^
2 )  -  A
)  e.  RR+ )
4017, 39ltsubrpd 9665 . . 3  |-  ( ph  ->  ( ( ( ( F `  N ) ^ 2 )  -  A )  -  (
( ( F `  M ) ^ 2 )  -  A ) )  <  ( ( ( F `  N
) ^ 2 )  -  A ) )
411, 2, 3resqrexlemcalc3 10958 . . . 4  |-  ( (
ph  /\  N  e.  NN )  ->  ( ( ( F `  N
) ^ 2 )  -  A )  <_ 
( ( ( F `
 1 ) ^
2 )  /  (
4 ^ ( N  -  1 ) ) ) )
425, 41mpdan 418 . . 3  |-  ( ph  ->  ( ( ( F `
 N ) ^
2 )  -  A
)  <_  ( (
( F `  1
) ^ 2 )  /  ( 4 ^ ( N  -  1 ) ) ) )
4319, 17, 34, 40, 42ltletrd 8321 . 2  |-  ( ph  ->  ( ( ( ( F `  N ) ^ 2 )  -  A )  -  (
( ( F `  M ) ^ 2 )  -  A ) )  <  ( ( ( F `  1
) ^ 2 )  /  ( 4 ^ ( N  -  1 ) ) ) )
4416, 43eqbrtrrd 4006 1  |-  ( ph  ->  ( ( ( F `
 N ) ^
2 )  -  (
( F `  M
) ^ 2 ) )  <  ( ( ( F `  1
) ^ 2 )  /  ( 4 ^ ( N  -  1 ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 104    = wceq 1343    e. wcel 2136   {csn 3576   class class class wbr 3982    X. cxp 4602   ` cfv 5188  (class class class)co 5842    e. cmpo 5844   RRcr 7752   0cc0 7753   1c1 7754    + caddc 7756    < clt 7933    <_ cle 7934    - cmin 8069    / cdiv 8568   NNcn 8857   2c2 8908   4c4 8910   ZZcz 9191   RR+crp 9589    seqcseq 10380   ^cexp 10454
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-coll 4097  ax-sep 4100  ax-nul 4108  ax-pow 4153  ax-pr 4187  ax-un 4411  ax-setind 4514  ax-iinf 4565  ax-cnex 7844  ax-resscn 7845  ax-1cn 7846  ax-1re 7847  ax-icn 7848  ax-addcl 7849  ax-addrcl 7850  ax-mulcl 7851  ax-mulrcl 7852  ax-addcom 7853  ax-mulcom 7854  ax-addass 7855  ax-mulass 7856  ax-distr 7857  ax-i2m1 7858  ax-0lt1 7859  ax-1rid 7860  ax-0id 7861  ax-rnegex 7862  ax-precex 7863  ax-cnre 7864  ax-pre-ltirr 7865  ax-pre-ltwlin 7866  ax-pre-lttrn 7867  ax-pre-apti 7868  ax-pre-ltadd 7869  ax-pre-mulgt0 7870  ax-pre-mulext 7871
This theorem depends on definitions:  df-bi 116  df-dc 825  df-3or 969  df-3an 970  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ne 2337  df-nel 2432  df-ral 2449  df-rex 2450  df-reu 2451  df-rmo 2452  df-rab 2453  df-v 2728  df-sbc 2952  df-csb 3046  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-nul 3410  df-if 3521  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-int 3825  df-iun 3868  df-br 3983  df-opab 4044  df-mpt 4045  df-tr 4081  df-id 4271  df-po 4274  df-iso 4275  df-iord 4344  df-on 4346  df-ilim 4347  df-suc 4349  df-iom 4568  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617  df-iota 5153  df-fun 5190  df-fn 5191  df-f 5192  df-f1 5193  df-fo 5194  df-f1o 5195  df-fv 5196  df-riota 5798  df-ov 5845  df-oprab 5846  df-mpo 5847  df-1st 6108  df-2nd 6109  df-recs 6273  df-frec 6359  df-pnf 7935  df-mnf 7936  df-xr 7937  df-ltxr 7938  df-le 7939  df-sub 8071  df-neg 8072  df-reap 8473  df-ap 8480  df-div 8569  df-inn 8858  df-2 8916  df-3 8917  df-4 8918  df-n0 9115  df-z 9192  df-uz 9467  df-rp 9590  df-seqfrec 10381  df-exp 10455
This theorem is referenced by:  resqrexlemnm  10960
  Copyright terms: Public domain W3C validator