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

Theorem cvgratnnlembern 12290
Description: Lemma for cvgratnn 12298. 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 8957 . . . . . . . . 9  |-  ( ph  ->  A #  0 )
41, 3rerecclapd 9164 . . . . . . . 8  |-  ( ph  ->  ( 1  /  A
)  e.  RR )
5 1red 8341 . . . . . . . 8  |-  ( ph  ->  1  e.  RR )
64, 5resubcld 8708 . . . . . . 7  |-  ( ph  ->  ( ( 1  /  A )  -  1 )  e.  RR )
7 cvgratnnlembern.m . . . . . . . 8  |-  ( ph  ->  M  e.  NN )
87nnred 9317 . . . . . . 7  |-  ( ph  ->  M  e.  RR )
96, 8remulcld 8356 . . . . . 6  |-  ( ph  ->  ( ( ( 1  /  A )  - 
1 )  x.  M
)  e.  RR )
109recnd 8354 . . . . 5  |-  ( ph  ->  ( ( ( 1  /  A )  - 
1 )  x.  M
)  e.  CC )
11 cvgratnnlembern.4 . . . . . . . . . 10  |-  ( ph  ->  A  <  1 )
121, 2elrpd 10094 . . . . . . . . . . 11  |-  ( ph  ->  A  e.  RR+ )
1312reclt1d 10111 . . . . . . . . . 10  |-  ( ph  ->  ( A  <  1  <->  1  <  ( 1  /  A ) ) )
1411, 13mpbid 147 . . . . . . . . 9  |-  ( ph  ->  1  <  ( 1  /  A ) )
155, 4posdifd 8860 . . . . . . . . 9  |-  ( ph  ->  ( 1  <  (
1  /  A )  <->  0  <  ( ( 1  /  A )  -  1 ) ) )
1614, 15mpbid 147 . . . . . . . 8  |-  ( ph  ->  0  <  ( ( 1  /  A )  -  1 ) )
176, 16elrpd 10094 . . . . . . 7  |-  ( ph  ->  ( ( 1  /  A )  -  1 )  e.  RR+ )
187nnrpd 10095 . . . . . . 7  |-  ( ph  ->  M  e.  RR+ )
1917, 18rpmulcld 10114 . . . . . 6  |-  ( ph  ->  ( ( ( 1  /  A )  - 
1 )  x.  M
)  e.  RR+ )
2019rpap0d 10103 . . . . 5  |-  ( ph  ->  ( ( ( 1  /  A )  - 
1 )  x.  M
) #  0 )
2110, 20recrecapd 9115 . . . 4  |-  ( ph  ->  ( 1  /  (
1  /  ( ( ( 1  /  A
)  -  1 )  x.  M ) ) )  =  ( ( ( 1  /  A
)  -  1 )  x.  M ) )
229, 5readdcld 8355 . . . . 5  |-  ( ph  ->  ( ( ( ( 1  /  A )  -  1 )  x.  M )  +  1 )  e.  RR )
237nnnn0d 9620 . . . . . . 7  |-  ( ph  ->  M  e.  NN0 )
241, 23reexpcld 11128 . . . . . 6  |-  ( ph  ->  ( A ^ M
)  e.  RR )
251recnd 8354 . . . . . . 7  |-  ( ph  ->  A  e.  CC )
267nnzd 9767 . . . . . . 7  |-  ( ph  ->  M  e.  ZZ )
2725, 3, 26expap0d 11117 . . . . . 6  |-  ( ph  ->  ( A ^ M
) #  0 )
2824, 27rerecclapd 9164 . . . . 5  |-  ( ph  ->  ( 1  /  ( A ^ M ) )  e.  RR )
299ltp1d 9260 . . . . 5  |-  ( ph  ->  ( ( ( 1  /  A )  - 
1 )  x.  M
)  <  ( (
( ( 1  /  A )  -  1 )  x.  M )  +  1 ) )
30 0le1 8809 . . . . . . . . 9  |-  0  <_  1
3130a1i 9 . . . . . . . 8  |-  ( ph  ->  0  <_  1 )
325, 12, 31divge0d 10138 . . . . . . 7  |-  ( ph  ->  0  <_  ( 1  /  A ) )
33 bernneq2 11099 . . . . . . 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 11119 . . . . . 6  |-  ( ph  ->  ( ( 1  /  A ) ^ M
)  =  ( 1  /  ( A ^ M ) ) )
3634, 35breqtrd 4156 . . . . 5  |-  ( ph  ->  ( ( ( ( 1  /  A )  -  1 )  x.  M )  +  1 )  <_  ( 1  /  ( A ^ M ) ) )
379, 22, 28, 29, 36ltletrd 8751 . . . 4  |-  ( ph  ->  ( ( ( 1  /  A )  - 
1 )  x.  M
)  <  ( 1  /  ( A ^ M ) ) )
3821, 37eqbrtrd 4152 . . 3  |-  ( ph  ->  ( 1  /  (
1  /  ( ( ( 1  /  A
)  -  1 )  x.  M ) ) )  <  ( 1  /  ( A ^ M ) ) )
3912, 26rpexpcld 11135 . . . 4  |-  ( ph  ->  ( A ^ M
)  e.  RR+ )
4019rpreccld 10108 . . . 4  |-  ( ph  ->  ( 1  /  (
( ( 1  /  A )  -  1 )  x.  M ) )  e.  RR+ )
4139, 40ltrecd 10116 . . 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 8354 . . 3  |-  ( ph  ->  ( ( 1  /  A )  -  1 )  e.  CC )
447nncnd 9318 . . 3  |-  ( ph  ->  M  e.  CC )
4517rpap0d 10103 . . 3  |-  ( ph  ->  ( ( 1  /  A )  -  1 ) #  0 )
4618rpap0d 10103 . . 3  |-  ( ph  ->  M #  0 )
4743, 44, 45, 46recdivap2d 9138 . 2  |-  ( ph  ->  ( ( 1  / 
( ( 1  /  A )  -  1 ) )  /  M
)  =  ( 1  /  ( ( ( 1  /  A )  -  1 )  x.  M ) ) )
4842, 47breqtrrd 4158 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 4130  (class class class)co 6085   RRcr 8178   0cc0 8179   1c1 8180    + caddc 8182    x. cmul 8184    < clt 8360    <_ cle 8361    - cmin 8497    / cdiv 9002   NNcn 9304   NN0cn0 9563   ^cexp 10975
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 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297
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 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-frec 6662  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8903  df-ap 8910  df-div 9003  df-inn 9305  df-n0 9564  df-z 9645  df-uz 9922  df-rp 10055  df-seqfrec 10885  df-exp 10976
This theorem is used by:  cvgratnnlemfm  12296
  Copyright terms: Public domain W3C validator