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

Theorem cvgratnnlembern 12315
Description: Lemma for cvgratnn 12323. Upper bound for a geometric progression of positive ratio less than one. (Contributed by Jim Kingdon, 24-Nov-2022.)
Hypotheses
Ref Expression
cvgratnnlembern.3  |-  ( ph  ->  A  e.  RR )
cvgratnnlembern.4  |-  ( ph  ->  A  <  1 )
cvgratnnlembern.gt0  |-  ( ph  ->  0  <  A )
cvgratnnlembern.m  |-  ( ph  ->  M  e.  NN )
Assertion
Ref Expression
cvgratnnlembern  |-  ( ph  ->  ( A ^ M
)  <  ( (
1  /  ( ( 1  /  A )  -  1 ) )  /  M ) )

Proof of Theorem cvgratnnlembern
StepHypRef Expression
1 cvgratnnlembern.3 . . . . . . . . 9  |-  ( ph  ->  A  e.  RR )
2 cvgratnnlembern.gt0 . . . . . . . . . 10  |-  ( ph  ->  0  <  A )
31, 2gt0ap0d 8965 . . . . . . . . 9  |-  ( ph  ->  A #  0 )
41, 3rerecclapd 9172 . . . . . . . 8  |-  ( ph  ->  ( 1  /  A
)  e.  RR )
5 1red 8347 . . . . . . . 8  |-  ( ph  ->  1  e.  RR )
64, 5resubcld 8715 . . . . . . 7  |-  ( ph  ->  ( ( 1  /  A )  -  1 )  e.  RR )
7 cvgratnnlembern.m . . . . . . . 8  |-  ( ph  ->  M  e.  NN )
87nnred 9326 . . . . . . 7  |-  ( ph  ->  M  e.  RR )
96, 8remulcld 8362 . . . . . 6  |-  ( ph  ->  ( ( ( 1  /  A )  - 
1 )  x.  M
)  e.  RR )
109recnd 8360 . . . . 5  |-  ( ph  ->  ( ( ( 1  /  A )  - 
1 )  x.  M
)  e.  CC )
11 cvgratnnlembern.4 . . . . . . . . . 10  |-  ( ph  ->  A  <  1 )
121, 2elrpd 10111 . . . . . . . . . . 11  |-  ( ph  ->  A  e.  RR+ )
1312reclt1d 10128 . . . . . . . . . 10  |-  ( ph  ->  ( A  <  1  <->  1  <  ( 1  /  A ) ) )
1411, 13mpbid 147 . . . . . . . . 9  |-  ( ph  ->  1  <  ( 1  /  A ) )
155, 4posdifd 8867 . . . . . . . . 9  |-  ( ph  ->  ( 1  <  (
1  /  A )  <->  0  <  ( ( 1  /  A )  -  1 ) ) )
1614, 15mpbid 147 . . . . . . . 8  |-  ( ph  ->  0  <  ( ( 1  /  A )  -  1 ) )
176, 16elrpd 10111 . . . . . . 7  |-  ( ph  ->  ( ( 1  /  A )  -  1 )  e.  RR+ )
187nnrpd 10112 . . . . . . 7  |-  ( ph  ->  M  e.  RR+ )
1917, 18rpmulcld 10131 . . . . . 6  |-  ( ph  ->  ( ( ( 1  /  A )  - 
1 )  x.  M
)  e.  RR+ )
2019rpap0d 10120 . . . . 5  |-  ( ph  ->  ( ( ( 1  /  A )  - 
1 )  x.  M
) #  0 )
2110, 20recrecapd 9123 . . . 4  |-  ( ph  ->  ( 1  /  (
1  /  ( ( ( 1  /  A
)  -  1 )  x.  M ) ) )  =  ( ( ( 1  /  A
)  -  1 )  x.  M ) )
229, 5readdcld 8361 . . . . 5  |-  ( ph  ->  ( ( ( ( 1  /  A )  -  1 )  x.  M )  +  1 )  e.  RR )
237nnnn0d 9631 . . . . . . 7  |-  ( ph  ->  M  e.  NN0 )
241, 23reexpcld 11149 . . . . . 6  |-  ( ph  ->  ( A ^ M
)  e.  RR )
251recnd 8360 . . . . . . 7  |-  ( ph  ->  A  e.  CC )
267nnzd 9778 . . . . . . 7  |-  ( ph  ->  M  e.  ZZ )
2725, 3, 26expap0d 11138 . . . . . 6  |-  ( ph  ->  ( A ^ M
) #  0 )
2824, 27rerecclapd 9172 . . . . 5  |-  ( ph  ->  ( 1  /  ( A ^ M ) )  e.  RR )
299ltp1d 9268 . . . . 5  |-  ( ph  ->  ( ( ( 1  /  A )  - 
1 )  x.  M
)  <  ( (
( ( 1  /  A )  -  1 )  x.  M )  +  1 ) )
30 0le1 8816 . . . . . . . . 9  |-  0  <_  1
3130a1i 9 . . . . . . . 8  |-  ( ph  ->  0  <_  1 )
325, 12, 31divge0d 10155 . . . . . . 7  |-  ( ph  ->  0  <_  ( 1  /  A ) )
33 bernneq2 11120 . . . . . . 7  |-  ( ( ( 1  /  A
)  e.  RR  /\  M  e.  NN0  /\  0  <_  ( 1  /  A
) )  ->  (
( ( ( 1  /  A )  - 
1 )  x.  M
)  +  1 )  <_  ( ( 1  /  A ) ^ M ) )
344, 23, 32, 33syl3anc 1278 . . . . . 6  |-  ( ph  ->  ( ( ( ( 1  /  A )  -  1 )  x.  M )  +  1 )  <_  ( (
1  /  A ) ^ M ) )
3525, 3, 26exprecapd 11140 . . . . . 6  |-  ( ph  ->  ( ( 1  /  A ) ^ M
)  =  ( 1  /  ( A ^ M ) ) )
3634, 35breqtrd 4157 . . . . 5  |-  ( ph  ->  ( ( ( ( 1  /  A )  -  1 )  x.  M )  +  1 )  <_  ( 1  /  ( A ^ M ) ) )
379, 22, 28, 29, 36ltletrd 8758 . . . 4  |-  ( ph  ->  ( ( ( 1  /  A )  - 
1 )  x.  M
)  <  ( 1  /  ( A ^ M ) ) )
3821, 37eqbrtrd 4153 . . 3  |-  ( ph  ->  ( 1  /  (
1  /  ( ( ( 1  /  A
)  -  1 )  x.  M ) ) )  <  ( 1  /  ( A ^ M ) ) )
3912, 26rpexpcld 11156 . . . 4  |-  ( ph  ->  ( A ^ M
)  e.  RR+ )
4019rpreccld 10125 . . . 4  |-  ( ph  ->  ( 1  /  (
( ( 1  /  A )  -  1 )  x.  M ) )  e.  RR+ )
4139, 40ltrecd 10133 . . 3  |-  ( ph  ->  ( ( A ^ M )  <  (
1  /  ( ( ( 1  /  A
)  -  1 )  x.  M ) )  <-> 
( 1  /  (
1  /  ( ( ( 1  /  A
)  -  1 )  x.  M ) ) )  <  ( 1  /  ( A ^ M ) ) ) )
4238, 41mpbird 167 . 2  |-  ( ph  ->  ( A ^ M
)  <  ( 1  /  ( ( ( 1  /  A )  -  1 )  x.  M ) ) )
436recnd 8360 . . 3  |-  ( ph  ->  ( ( 1  /  A )  -  1 )  e.  CC )
447nncnd 9327 . . 3  |-  ( ph  ->  M  e.  CC )
4517rpap0d 10120 . . 3  |-  ( ph  ->  ( ( 1  /  A )  -  1 ) #  0 )
4618rpap0d 10120 . . 3  |-  ( ph  ->  M #  0 )
4743, 44, 45, 46recdivap2d 9146 . 2  |-  ( ph  ->  ( ( 1  / 
( ( 1  /  A )  -  1 ) )  /  M
)  =  ( 1  /  ( ( ( 1  /  A )  -  1 )  x.  M ) ) )
4842, 47breqtrrd 4159 1  |-  ( ph  ->  ( A ^ M
)  <  ( (
1  /  ( ( 1  /  A )  -  1 ) )  /  M ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    e. wcel 2209   class class class wbr 4131  (class class class)co 6088   RRcr 8184   0cc0 8185   1c1 8186    + caddc 8188    x. cmul 8190    < clt 8366    <_ cle 8367    - cmin 8504    / cdiv 9010   NNcn 9313   NN0cn0 9574   ^cexp 10996
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 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-mulrcl 8284  ax-addcom 8285  ax-mulcom 8286  ax-addass 8287  ax-mulass 8288  ax-distr 8289  ax-i2m1 8290  ax-0lt1 8291  ax-1rid 8292  ax-0id 8293  ax-rnegex 8294  ax-precex 8295  ax-cnre 8296  ax-pre-ltirr 8297  ax-pre-ltwlin 8298  ax-pre-lttrn 8299  ax-pre-apti 8300  ax-pre-ltadd 8301  ax-pre-mulgt0 8302  ax-pre-mulext 8303
This proof 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 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-po 4443  df-iso 4444  df-iord 4513  df-on 4515  df-ilim 4516  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-frec 6666  df-pnf 8368  df-mnf 8369  df-xr 8370  df-ltxr 8371  df-le 8372  df-sub 8506  df-neg 8507  df-reap 8911  df-ap 8918  df-div 9011  df-inn 9314  df-n0 9575  df-z 9656  df-uz 9938  df-rp 10072  df-seqfrec 10906  df-exp 10997
This theorem is used by:  cvgratnnlemfm  12321
  Copyright terms: Public domain W3C validator