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

Theorem resqrexlemnmsq 11657
Description: Lemma for resqrex 11666. 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 11647 . . . . . . 7  |-  ( ph  ->  F : NN --> RR+ )
5 resqrexlemnmsq.n . . . . . . 7  |-  ( ph  ->  N  e.  NN )
64, 5ffvelcdmd 5791 . . . . . 6  |-  ( ph  ->  ( F `  N
)  e.  RR+ )
76rpred 9992 . . . . 5  |-  ( ph  ->  ( F `  N
)  e.  RR )
87resqcld 11024 . . . 4  |-  ( ph  ->  ( ( F `  N ) ^ 2 )  e.  RR )
98recnd 8267 . . 3  |-  ( ph  ->  ( ( F `  N ) ^ 2 )  e.  CC )
10 resqrexlemnmsq.m . . . . . . 7  |-  ( ph  ->  M  e.  NN )
114, 10ffvelcdmd 5791 . . . . . 6  |-  ( ph  ->  ( F `  M
)  e.  RR+ )
1211rpred 9992 . . . . 5  |-  ( ph  ->  ( F `  M
)  e.  RR )
1312resqcld 11024 . . . 4  |-  ( ph  ->  ( ( F `  M ) ^ 2 )  e.  RR )
1413recnd 8267 . . 3  |-  ( ph  ->  ( ( F `  M ) ^ 2 )  e.  CC )
152recnd 8267 . . 3  |-  ( ph  ->  A  e.  CC )
169, 14, 15nnncan2d 8584 . 2  |-  ( ph  ->  ( ( ( ( F `  N ) ^ 2 )  -  A )  -  (
( ( F `  M ) ^ 2 )  -  A ) )  =  ( ( ( F `  N
) ^ 2 )  -  ( ( F `
 M ) ^
2 ) ) )
178, 2resubcld 8619 . . . 4  |-  ( ph  ->  ( ( ( F `
 N ) ^
2 )  -  A
)  e.  RR )
1813, 2resubcld 8619 . . . 4  |-  ( ph  ->  ( ( ( F `
 M ) ^
2 )  -  A
)  e.  RR )
1917, 18resubcld 8619 . . 3  |-  ( ph  ->  ( ( ( ( F `  N ) ^ 2 )  -  A )  -  (
( ( F `  M ) ^ 2 )  -  A ) )  e.  RR )
20 1nn 9213 . . . . . . . 8  |-  1  e.  NN
2120a1i 9 . . . . . . 7  |-  ( ph  ->  1  e.  NN )
224, 21ffvelcdmd 5791 . . . . . 6  |-  ( ph  ->  ( F `  1
)  e.  RR+ )
23 2z 9568 . . . . . . 7  |-  2  e.  ZZ
2423a1i 9 . . . . . 6  |-  ( ph  ->  2  e.  ZZ )
2522, 24rpexpcld 11022 . . . . 5  |-  ( ph  ->  ( ( F ` 
1 ) ^ 2 )  e.  RR+ )
26 4nn 9366 . . . . . . . 8  |-  4  e.  NN
2726a1i 9 . . . . . . 7  |-  ( ph  ->  4  e.  NN )
2827nnrpd 9990 . . . . . 6  |-  ( ph  ->  4  e.  RR+ )
295nnzd 9662 . . . . . . 7  |-  ( ph  ->  N  e.  ZZ )
30 1zzd 9567 . . . . . . 7  |-  ( ph  ->  1  e.  ZZ )
3129, 30zsubcld 9668 . . . . . 6  |-  ( ph  ->  ( N  -  1 )  e.  ZZ )
3228, 31rpexpcld 11022 . . . . 5  |-  ( ph  ->  ( 4 ^ ( N  -  1 ) )  e.  RR+ )
3325, 32rpdivcld 10010 . . . 4  |-  ( ph  ->  ( ( ( F `
 1 ) ^
2 )  /  (
4 ^ ( N  -  1 ) ) )  e.  RR+ )
3433rpred 9992 . . 3  |-  ( ph  ->  ( ( ( F `
 1 ) ^
2 )  /  (
4 ^ ( N  -  1 ) ) )  e.  RR )
351, 2, 3resqrexlemover 11650 . . . . . 6  |-  ( (
ph  /\  M  e.  NN )  ->  A  < 
( ( F `  M ) ^ 2 ) )
3610, 35mpdan 421 . . . . 5  |-  ( ph  ->  A  <  ( ( F `  M ) ^ 2 ) )
37 difrp 9988 . . . . . 6  |-  ( ( A  e.  RR  /\  ( ( F `  M ) ^ 2 )  e.  RR )  ->  ( A  < 
( ( F `  M ) ^ 2 )  <->  ( ( ( F `  M ) ^ 2 )  -  A )  e.  RR+ ) )
382, 13, 37syl2anc 411 . . . . 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 10025 . . 3  |-  ( ph  ->  ( ( ( ( F `  N ) ^ 2 )  -  A )  -  (
( ( F `  M ) ^ 2 )  -  A ) )  <  ( ( ( F `  N
) ^ 2 )  -  A ) )
411, 2, 3resqrexlemcalc3 11656 . . . 4  |-  ( (
ph  /\  N  e.  NN )  ->  ( ( ( F `  N
) ^ 2 )  -  A )  <_ 
( ( ( F `
 1 ) ^
2 )  /  (
4 ^ ( N  -  1 ) ) ) )
425, 41mpdan 421 . . 3  |-  ( ph  ->  ( ( ( F `
 N ) ^
2 )  -  A
)  <_  ( (
( F `  1
) ^ 2 )  /  ( 4 ^ ( N  -  1 ) ) ) )
4319, 17, 34, 40, 42ltletrd 8662 . 2  |-  ( ph  ->  ( ( ( ( F `  N ) ^ 2 )  -  A )  -  (
( ( F `  M ) ^ 2 )  -  A ) )  <  ( ( ( F `  1
) ^ 2 )  /  ( 4 ^ ( N  -  1 ) ) ) )
4416, 43eqbrtrrd 4117 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 1398    e. wcel 2202   {csn 3673   class class class wbr 4093    X. cxp 4729   ` cfv 5333  (class class class)co 6028    e. cmpo 6030   RRcr 8091   0cc0 8092   1c1 8093    + caddc 8095    < clt 8273    <_ cle 8274    - cmin 8409    / cdiv 8911   NNcn 9202   2c2 9253   4c4 9255   ZZcz 9540   RR+crp 9949    seqcseq 10772   ^cexp 10863
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 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692  ax-cnex 8183  ax-resscn 8184  ax-1cn 8185  ax-1re 8186  ax-icn 8187  ax-addcl 8188  ax-addrcl 8189  ax-mulcl 8190  ax-mulrcl 8191  ax-addcom 8192  ax-mulcom 8193  ax-addass 8194  ax-mulass 8195  ax-distr 8196  ax-i2m1 8197  ax-0lt1 8198  ax-1rid 8199  ax-0id 8200  ax-rnegex 8201  ax-precex 8202  ax-cnre 8203  ax-pre-ltirr 8204  ax-pre-ltwlin 8205  ax-pre-lttrn 8206  ax-pre-apti 8207  ax-pre-ltadd 8208  ax-pre-mulgt0 8209  ax-pre-mulext 8210
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rmo 2519  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-if 3608  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-id 4396  df-po 4399  df-iso 4400  df-iord 4469  df-on 4471  df-ilim 4472  df-suc 4474  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-recs 6514  df-frec 6600  df-pnf 8275  df-mnf 8276  df-xr 8277  df-ltxr 8278  df-le 8279  df-sub 8411  df-neg 8412  df-reap 8814  df-ap 8821  df-div 8912  df-inn 9203  df-2 9261  df-3 9262  df-4 9263  df-n0 9462  df-z 9541  df-uz 9817  df-rp 9950  df-seqfrec 10773  df-exp 10864
This theorem is referenced by:  resqrexlemnm  11658
  Copyright terms: Public domain W3C validator