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

Theorem resqrexlemnmsq 11761
Description: Lemma for resqrex 11770. 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 11751 . . . . . . 7  |-  ( ph  ->  F : NN --> RR+ )
5 resqrexlemnmsq.n . . . . . . 7  |-  ( ph  ->  N  e.  NN )
64, 5ffvelcdmd 5835 . . . . . 6  |-  ( ph  ->  ( F `  N
)  e.  RR+ )
76rpred 10076 . . . . 5  |-  ( ph  ->  ( F `  N
)  e.  RR )
87resqcld 11115 . . . 4  |-  ( ph  ->  ( ( F `  N ) ^ 2 )  e.  RR )
98recnd 8344 . . 3  |-  ( ph  ->  ( ( F `  N ) ^ 2 )  e.  CC )
10 resqrexlemnmsq.m . . . . . . 7  |-  ( ph  ->  M  e.  NN )
114, 10ffvelcdmd 5835 . . . . . 6  |-  ( ph  ->  ( F `  M
)  e.  RR+ )
1211rpred 10076 . . . . 5  |-  ( ph  ->  ( F `  M
)  e.  RR )
1312resqcld 11115 . . . 4  |-  ( ph  ->  ( ( F `  M ) ^ 2 )  e.  RR )
1413recnd 8344 . . 3  |-  ( ph  ->  ( ( F `  M ) ^ 2 )  e.  CC )
152recnd 8344 . . 3  |-  ( ph  ->  A  e.  CC )
169, 14, 15nnncan2d 8662 . 2  |-  ( ph  ->  ( ( ( ( F `  N ) ^ 2 )  -  A )  -  (
( ( F `  M ) ^ 2 )  -  A ) )  =  ( ( ( F `  N
) ^ 2 )  -  ( ( F `
 M ) ^
2 ) ) )
178, 2resubcld 8698 . . . 4  |-  ( ph  ->  ( ( ( F `
 N ) ^
2 )  -  A
)  e.  RR )
1813, 2resubcld 8698 . . . 4  |-  ( ph  ->  ( ( ( F `
 M ) ^
2 )  -  A
)  e.  RR )
1917, 18resubcld 8698 . . 3  |-  ( ph  ->  ( ( ( ( F `  N ) ^ 2 )  -  A )  -  (
( ( F `  M ) ^ 2 )  -  A ) )  e.  RR )
20 1nn 9294 . . . . . . . 8  |-  1  e.  NN
2120a1i 9 . . . . . . 7  |-  ( ph  ->  1  e.  NN )
224, 21ffvelcdmd 5835 . . . . . 6  |-  ( ph  ->  ( F `  1
)  e.  RR+ )
23 2z 9651 . . . . . . 7  |-  2  e.  ZZ
2423a1i 9 . . . . . 6  |-  ( ph  ->  2  e.  ZZ )
2522, 24rpexpcld 11113 . . . . 5  |-  ( ph  ->  ( ( F ` 
1 ) ^ 2 )  e.  RR+ )
26 4nn 9447 . . . . . . . 8  |-  4  e.  NN
2726a1i 9 . . . . . . 7  |-  ( ph  ->  4  e.  NN )
2827nnrpd 10074 . . . . . 6  |-  ( ph  ->  4  e.  RR+ )
295nnzd 9746 . . . . . . 7  |-  ( ph  ->  N  e.  ZZ )
30 1zzd 9650 . . . . . . 7  |-  ( ph  ->  1  e.  ZZ )
3129, 30zsubcld 9752 . . . . . 6  |-  ( ph  ->  ( N  -  1 )  e.  ZZ )
3228, 31rpexpcld 11113 . . . . 5  |-  ( ph  ->  ( 4 ^ ( N  -  1 ) )  e.  RR+ )
3325, 32rpdivcld 10094 . . . 4  |-  ( ph  ->  ( ( ( F `
 1 ) ^
2 )  /  (
4 ^ ( N  -  1 ) ) )  e.  RR+ )
3433rpred 10076 . . 3  |-  ( ph  ->  ( ( ( F `
 1 ) ^
2 )  /  (
4 ^ ( N  -  1 ) ) )  e.  RR )
351, 2, 3resqrexlemover 11754 . . . . . 6  |-  ( (
ph  /\  M  e.  NN )  ->  A  < 
( ( F `  M ) ^ 2 ) )
3610, 35mpdan 425 . . . . 5  |-  ( ph  ->  A  <  ( ( F `  M ) ^ 2 ) )
37 difrp 10072 . . . . . 6  |-  ( ( A  e.  RR  /\  ( ( F `  M ) ^ 2 )  e.  RR )  ->  ( A  < 
( ( F `  M ) ^ 2 )  <->  ( ( ( F `  M ) ^ 2 )  -  A )  e.  RR+ ) )
382, 13, 37syl2anc 415 . . . . 5  |-  ( ph  ->  ( A  <  (
( F `  M
) ^ 2 )  <-> 
( ( ( F `
 M ) ^
2 )  -  A
)  e.  RR+ )
)
3936, 38mpbid 147 . . . 4  |-  ( ph  ->  ( ( ( F `
 M ) ^
2 )  -  A
)  e.  RR+ )
4017, 39ltsubrpd 10109 . . 3  |-  ( ph  ->  ( ( ( ( F `  N ) ^ 2 )  -  A )  -  (
( ( F `  M ) ^ 2 )  -  A ) )  <  ( ( ( F `  N
) ^ 2 )  -  A ) )
411, 2, 3resqrexlemcalc3 11760 . . . 4  |-  ( (
ph  /\  N  e.  NN )  ->  ( ( ( F `  N
) ^ 2 )  -  A )  <_ 
( ( ( F `
 1 ) ^
2 )  /  (
4 ^ ( N  -  1 ) ) ) )
425, 41mpdan 425 . . 3  |-  ( ph  ->  ( ( ( F `
 N ) ^
2 )  -  A
)  <_  ( (
( F `  1
) ^ 2 )  /  ( 4 ^ ( N  -  1 ) ) ) )
4319, 17, 34, 40, 42ltletrd 8741 . 2  |-  ( ph  ->  ( ( ( ( F `  N ) ^ 2 )  -  A )  -  (
( ( F `  M ) ^ 2 )  -  A ) )  <  ( ( ( F `  1
) ^ 2 )  /  ( 4 ^ ( N  -  1 ) ) ) )
4416, 43eqbrtrrd 4149 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 105    = wceq 1402    e. wcel 2209   {csn 3705   class class class wbr 4125    X. cxp 4767   ` cfv 5372  (class class class)co 6075    e. cmpo 6077   RRcr 8168   0cc0 8169   1c1 8170    + caddc 8172    < clt 8350    <_ cle 8351    - cmin 8487    / cdiv 8992   NNcn 9283   2c2 9334   4c4 9336   ZZcz 9623   RR+crp 10033    seqcseq 10862   ^cexp 10953
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 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 4241  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-iinf 4730  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-mulrcl 8268  ax-addcom 8269  ax-mulcom 8270  ax-addass 8271  ax-mulass 8272  ax-distr 8273  ax-i2m1 8274  ax-0lt1 8275  ax-1rid 8276  ax-0id 8277  ax-rnegex 8278  ax-precex 8279  ax-cnre 8280  ax-pre-ltirr 8281  ax-pre-ltwlin 8282  ax-pre-lttrn 8283  ax-pre-apti 8284  ax-pre-ltadd 8285  ax-pre-mulgt0 8286  ax-pre-mulext 8287
This theorem depends on definitions:  df-bi 117  df-dc 847  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-if 3636  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-tr 4225  df-id 4433  df-po 4436  df-iso 4437  df-iord 4506  df-on 4508  df-ilim 4509  df-suc 4511  df-iom 4733  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  df-recs 6566  df-frec 6652  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356  df-sub 8489  df-neg 8490  df-reap 8893  df-ap 8900  df-div 8993  df-inn 9284  df-2 9342  df-3 9343  df-4 9344  df-n0 9543  df-z 9624  df-uz 9901  df-rp 10034  df-seqfrec 10863  df-exp 10954
This theorem is referenced by:  resqrexlemnm  11762
  Copyright terms: Public domain W3C validator