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

Theorem cvgratnnlembern 11666
Description: Lemma for cvgratnn 11674. 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 8648 . . . . . . . . 9  |-  ( ph  ->  A #  0 )
41, 3rerecclapd 8853 . . . . . . . 8  |-  ( ph  ->  ( 1  /  A
)  e.  RR )
5 1red 8034 . . . . . . . 8  |-  ( ph  ->  1  e.  RR )
64, 5resubcld 8400 . . . . . . 7  |-  ( ph  ->  ( ( 1  /  A )  -  1 )  e.  RR )
7 cvgratnnlembern.m . . . . . . . 8  |-  ( ph  ->  M  e.  NN )
87nnred 8995 . . . . . . 7  |-  ( ph  ->  M  e.  RR )
96, 8remulcld 8050 . . . . . 6  |-  ( ph  ->  ( ( ( 1  /  A )  - 
1 )  x.  M
)  e.  RR )
109recnd 8048 . . . . 5  |-  ( ph  ->  ( ( ( 1  /  A )  - 
1 )  x.  M
)  e.  CC )
11 cvgratnnlembern.4 . . . . . . . . . 10  |-  ( ph  ->  A  <  1 )
121, 2elrpd 9759 . . . . . . . . . . 11  |-  ( ph  ->  A  e.  RR+ )
1312reclt1d 9776 . . . . . . . . . 10  |-  ( ph  ->  ( A  <  1  <->  1  <  ( 1  /  A ) ) )
1411, 13mpbid 147 . . . . . . . . 9  |-  ( ph  ->  1  <  ( 1  /  A ) )
155, 4posdifd 8551 . . . . . . . . 9  |-  ( ph  ->  ( 1  <  (
1  /  A )  <->  0  <  ( ( 1  /  A )  -  1 ) ) )
1614, 15mpbid 147 . . . . . . . 8  |-  ( ph  ->  0  <  ( ( 1  /  A )  -  1 ) )
176, 16elrpd 9759 . . . . . . 7  |-  ( ph  ->  ( ( 1  /  A )  -  1 )  e.  RR+ )
187nnrpd 9760 . . . . . . 7  |-  ( ph  ->  M  e.  RR+ )
1917, 18rpmulcld 9779 . . . . . 6  |-  ( ph  ->  ( ( ( 1  /  A )  - 
1 )  x.  M
)  e.  RR+ )
2019rpap0d 9768 . . . . 5  |-  ( ph  ->  ( ( ( 1  /  A )  - 
1 )  x.  M
) #  0 )
2110, 20recrecapd 8804 . . . 4  |-  ( ph  ->  ( 1  /  (
1  /  ( ( ( 1  /  A
)  -  1 )  x.  M ) ) )  =  ( ( ( 1  /  A
)  -  1 )  x.  M ) )
229, 5readdcld 8049 . . . . 5  |-  ( ph  ->  ( ( ( ( 1  /  A )  -  1 )  x.  M )  +  1 )  e.  RR )
237nnnn0d 9293 . . . . . . 7  |-  ( ph  ->  M  e.  NN0 )
241, 23reexpcld 10761 . . . . . 6  |-  ( ph  ->  ( A ^ M
)  e.  RR )
251recnd 8048 . . . . . . 7  |-  ( ph  ->  A  e.  CC )
267nnzd 9438 . . . . . . 7  |-  ( ph  ->  M  e.  ZZ )
2725, 3, 26expap0d 10750 . . . . . 6  |-  ( ph  ->  ( A ^ M
) #  0 )
2824, 27rerecclapd 8853 . . . . 5  |-  ( ph  ->  ( 1  /  ( A ^ M ) )  e.  RR )
299ltp1d 8949 . . . . 5  |-  ( ph  ->  ( ( ( 1  /  A )  - 
1 )  x.  M
)  <  ( (
( ( 1  /  A )  -  1 )  x.  M )  +  1 ) )
30 0le1 8500 . . . . . . . . 9  |-  0  <_  1
3130a1i 9 . . . . . . . 8  |-  ( ph  ->  0  <_  1 )
325, 12, 31divge0d 9803 . . . . . . 7  |-  ( ph  ->  0  <_  ( 1  /  A ) )
33 bernneq2 10732 . . . . . . 7  |-  ( ( ( 1  /  A
)  e.  RR  /\  M  e.  NN0  /\  0  <_  ( 1  /  A
) )  ->  (
( ( ( 1  /  A )  - 
1 )  x.  M
)  +  1 )  <_  ( ( 1  /  A ) ^ M ) )
344, 23, 32, 33syl3anc 1249 . . . . . 6  |-  ( ph  ->  ( ( ( ( 1  /  A )  -  1 )  x.  M )  +  1 )  <_  ( (
1  /  A ) ^ M ) )
3525, 3, 26exprecapd 10752 . . . . . 6  |-  ( ph  ->  ( ( 1  /  A ) ^ M
)  =  ( 1  /  ( A ^ M ) ) )
3634, 35breqtrd 4055 . . . . 5  |-  ( ph  ->  ( ( ( ( 1  /  A )  -  1 )  x.  M )  +  1 )  <_  ( 1  /  ( A ^ M ) ) )
379, 22, 28, 29, 36ltletrd 8442 . . . 4  |-  ( ph  ->  ( ( ( 1  /  A )  - 
1 )  x.  M
)  <  ( 1  /  ( A ^ M ) ) )
3821, 37eqbrtrd 4051 . . 3  |-  ( ph  ->  ( 1  /  (
1  /  ( ( ( 1  /  A
)  -  1 )  x.  M ) ) )  <  ( 1  /  ( A ^ M ) ) )
3912, 26rpexpcld 10768 . . . 4  |-  ( ph  ->  ( A ^ M
)  e.  RR+ )
4019rpreccld 9773 . . . 4  |-  ( ph  ->  ( 1  /  (
( ( 1  /  A )  -  1 )  x.  M ) )  e.  RR+ )
4139, 40ltrecd 9781 . . 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 8048 . . 3  |-  ( ph  ->  ( ( 1  /  A )  -  1 )  e.  CC )
447nncnd 8996 . . 3  |-  ( ph  ->  M  e.  CC )
4517rpap0d 9768 . . 3  |-  ( ph  ->  ( ( 1  /  A )  -  1 ) #  0 )
4618rpap0d 9768 . . 3  |-  ( ph  ->  M #  0 )
4743, 44, 45, 46recdivap2d 8827 . 2  |-  ( ph  ->  ( ( 1  / 
( ( 1  /  A )  -  1 ) )  /  M
)  =  ( 1  /  ( ( ( 1  /  A )  -  1 )  x.  M ) ) )
4842, 47breqtrrd 4057 1  |-  ( ph  ->  ( A ^ M
)  <  ( (
1  /  ( ( 1  /  A )  -  1 ) )  /  M ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    e. wcel 2164   class class class wbr 4029  (class class class)co 5918   RRcr 7871   0cc0 7872   1c1 7873    + caddc 7875    x. cmul 7877    < clt 8054    <_ cle 8055    - cmin 8190    / cdiv 8691   NNcn 8982   NN0cn0 9240   ^cexp 10609
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4144  ax-sep 4147  ax-nul 4155  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-iinf 4620  ax-cnex 7963  ax-resscn 7964  ax-1cn 7965  ax-1re 7966  ax-icn 7967  ax-addcl 7968  ax-addrcl 7969  ax-mulcl 7970  ax-mulrcl 7971  ax-addcom 7972  ax-mulcom 7973  ax-addass 7974  ax-mulass 7975  ax-distr 7976  ax-i2m1 7977  ax-0lt1 7978  ax-1rid 7979  ax-0id 7980  ax-rnegex 7981  ax-precex 7982  ax-cnre 7983  ax-pre-ltirr 7984  ax-pre-ltwlin 7985  ax-pre-lttrn 7986  ax-pre-apti 7987  ax-pre-ltadd 7988  ax-pre-mulgt0 7989  ax-pre-mulext 7990
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rmo 2480  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-if 3558  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-tr 4128  df-id 4324  df-po 4327  df-iso 4328  df-iord 4397  df-on 4399  df-ilim 4400  df-suc 4402  df-iom 4623  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262  df-riota 5873  df-ov 5921  df-oprab 5922  df-mpo 5923  df-1st 6193  df-2nd 6194  df-recs 6358  df-frec 6444  df-pnf 8056  df-mnf 8057  df-xr 8058  df-ltxr 8059  df-le 8060  df-sub 8192  df-neg 8193  df-reap 8594  df-ap 8601  df-div 8692  df-inn 8983  df-n0 9241  df-z 9318  df-uz 9593  df-rp 9720  df-seqfrec 10519  df-exp 10610
This theorem is referenced by:  cvgratnnlemfm  11672
  Copyright terms: Public domain W3C validator