MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  expubnd Unicode version

Theorem expubnd 11252
Description: An upper bound on  A ^ N when  2  <_  A. (Contributed by NM, 19-Dec-2005.)
Assertion
Ref Expression
expubnd  |-  ( ( A  e.  RR  /\  N  e.  NN0  /\  2  <_  A )  ->  ( A ^ N )  <_ 
( ( 2 ^ N )  x.  (
( A  -  1 ) ^ N ) ) )

Proof of Theorem expubnd
StepHypRef Expression
1 simp1 955 . . 3  |-  ( ( A  e.  RR  /\  N  e.  NN0  /\  2  <_  A )  ->  A  e.  RR )
2 2re 9902 . . . . 5  |-  2  e.  RR
3 peano2rem 9200 . . . . 5  |-  ( A  e.  RR  ->  ( A  -  1 )  e.  RR )
4 remulcl 8909 . . . . 5  |-  ( ( 2  e.  RR  /\  ( A  -  1
)  e.  RR )  ->  ( 2  x.  ( A  -  1 ) )  e.  RR )
52, 3, 4sylancr 644 . . . 4  |-  ( A  e.  RR  ->  (
2  x.  ( A  -  1 ) )  e.  RR )
653ad2ant1 976 . . 3  |-  ( ( A  e.  RR  /\  N  e.  NN0  /\  2  <_  A )  ->  (
2  x.  ( A  -  1 ) )  e.  RR )
7 simp2 956 . . 3  |-  ( ( A  e.  RR  /\  N  e.  NN0  /\  2  <_  A )  ->  N  e.  NN0 )
8 0re 8925 . . . . . . . 8  |-  0  e.  RR
9 2pos 9915 . . . . . . . 8  |-  0  <  2
108, 2, 9ltleii 9028 . . . . . . 7  |-  0  <_  2
11 letr 9001 . . . . . . . 8  |-  ( ( 0  e.  RR  /\  2  e.  RR  /\  A  e.  RR )  ->  (
( 0  <_  2  /\  2  <_  A )  ->  0  <_  A
) )
128, 2, 11mp3an12 1267 . . . . . . 7  |-  ( A  e.  RR  ->  (
( 0  <_  2  /\  2  <_  A )  ->  0  <_  A
) )
1310, 12mpani 657 . . . . . 6  |-  ( A  e.  RR  ->  (
2  <_  A  ->  0  <_  A ) )
1413imp 418 . . . . 5  |-  ( ( A  e.  RR  /\  2  <_  A )  -> 
0  <_  A )
15 resubcl 9198 . . . . . . . . 9  |-  ( ( A  e.  RR  /\  2  e.  RR )  ->  ( A  -  2 )  e.  RR )
162, 15mpan2 652 . . . . . . . 8  |-  ( A  e.  RR  ->  ( A  -  2 )  e.  RR )
17 leadd2 9330 . . . . . . . . 9  |-  ( ( 2  e.  RR  /\  A  e.  RR  /\  ( A  -  2 )  e.  RR )  -> 
( 2  <_  A  <->  ( ( A  -  2 )  +  2 )  <_  ( ( A  -  2 )  +  A ) ) )
182, 17mp3an1 1264 . . . . . . . 8  |-  ( ( A  e.  RR  /\  ( A  -  2
)  e.  RR )  ->  ( 2  <_  A 
<->  ( ( A  - 
2 )  +  2 )  <_  ( ( A  -  2 )  +  A ) ) )
1916, 18mpdan 649 . . . . . . 7  |-  ( A  e.  RR  ->  (
2  <_  A  <->  ( ( A  -  2 )  +  2 )  <_ 
( ( A  - 
2 )  +  A
) ) )
2019biimpa 470 . . . . . 6  |-  ( ( A  e.  RR  /\  2  <_  A )  -> 
( ( A  - 
2 )  +  2 )  <_  ( ( A  -  2 )  +  A ) )
21 recn 8914 . . . . . . . 8  |-  ( A  e.  RR  ->  A  e.  CC )
22 2cn 9903 . . . . . . . 8  |-  2  e.  CC
23 npcan 9147 . . . . . . . 8  |-  ( ( A  e.  CC  /\  2  e.  CC )  ->  ( ( A  - 
2 )  +  2 )  =  A )
2421, 22, 23sylancl 643 . . . . . . 7  |-  ( A  e.  RR  ->  (
( A  -  2 )  +  2 )  =  A )
2524adantr 451 . . . . . 6  |-  ( ( A  e.  RR  /\  2  <_  A )  -> 
( ( A  - 
2 )  +  2 )  =  A )
26 ax-1cn 8882 . . . . . . . . . 10  |-  1  e.  CC
27 subdi 9300 . . . . . . . . . 10  |-  ( ( 2  e.  CC  /\  A  e.  CC  /\  1  e.  CC )  ->  (
2  x.  ( A  -  1 ) )  =  ( ( 2  x.  A )  -  ( 2  x.  1 ) ) )
2822, 26, 27mp3an13 1268 . . . . . . . . 9  |-  ( A  e.  CC  ->  (
2  x.  ( A  -  1 ) )  =  ( ( 2  x.  A )  -  ( 2  x.  1 ) ) )
29 2times 9932 . . . . . . . . . 10  |-  ( A  e.  CC  ->  (
2  x.  A )  =  ( A  +  A ) )
3022mulid1i 8926 . . . . . . . . . . 11  |-  ( 2  x.  1 )  =  2
3130a1i 10 . . . . . . . . . 10  |-  ( A  e.  CC  ->  (
2  x.  1 )  =  2 )
3229, 31oveq12d 5960 . . . . . . . . 9  |-  ( A  e.  CC  ->  (
( 2  x.  A
)  -  ( 2  x.  1 ) )  =  ( ( A  +  A )  - 
2 ) )
33 addsub 9149 . . . . . . . . . . 11  |-  ( ( A  e.  CC  /\  A  e.  CC  /\  2  e.  CC )  ->  (
( A  +  A
)  -  2 )  =  ( ( A  -  2 )  +  A ) )
3422, 33mp3an3 1266 . . . . . . . . . 10  |-  ( ( A  e.  CC  /\  A  e.  CC )  ->  ( ( A  +  A )  -  2 )  =  ( ( A  -  2 )  +  A ) )
3534anidms 626 . . . . . . . . 9  |-  ( A  e.  CC  ->  (
( A  +  A
)  -  2 )  =  ( ( A  -  2 )  +  A ) )
3628, 32, 353eqtrrd 2395 . . . . . . . 8  |-  ( A  e.  CC  ->  (
( A  -  2 )  +  A )  =  ( 2  x.  ( A  -  1 ) ) )
3721, 36syl 15 . . . . . . 7  |-  ( A  e.  RR  ->  (
( A  -  2 )  +  A )  =  ( 2  x.  ( A  -  1 ) ) )
3837adantr 451 . . . . . 6  |-  ( ( A  e.  RR  /\  2  <_  A )  -> 
( ( A  - 
2 )  +  A
)  =  ( 2  x.  ( A  - 
1 ) ) )
3920, 25, 383brtr3d 4131 . . . . 5  |-  ( ( A  e.  RR  /\  2  <_  A )  ->  A  <_  ( 2  x.  ( A  -  1 ) ) )
4014, 39jca 518 . . . 4  |-  ( ( A  e.  RR  /\  2  <_  A )  -> 
( 0  <_  A  /\  A  <_  ( 2  x.  ( A  - 
1 ) ) ) )
41403adant2 974 . . 3  |-  ( ( A  e.  RR  /\  N  e.  NN0  /\  2  <_  A )  ->  (
0  <_  A  /\  A  <_  ( 2  x.  ( A  -  1 ) ) ) )
42 leexp1a 11250 . . 3  |-  ( ( ( A  e.  RR  /\  ( 2  x.  ( A  -  1 ) )  e.  RR  /\  N  e.  NN0 )  /\  ( 0  <_  A  /\  A  <_  ( 2  x.  ( A  - 
1 ) ) ) )  ->  ( A ^ N )  <_  (
( 2  x.  ( A  -  1 ) ) ^ N ) )
431, 6, 7, 41, 42syl31anc 1185 . 2  |-  ( ( A  e.  RR  /\  N  e.  NN0  /\  2  <_  A )  ->  ( A ^ N )  <_ 
( ( 2  x.  ( A  -  1 ) ) ^ N
) )
443recnd 8948 . . . 4  |-  ( A  e.  RR  ->  ( A  -  1 )  e.  CC )
45 mulexp 11231 . . . . 5  |-  ( ( 2  e.  CC  /\  ( A  -  1
)  e.  CC  /\  N  e.  NN0 )  -> 
( ( 2  x.  ( A  -  1 ) ) ^ N
)  =  ( ( 2 ^ N )  x.  ( ( A  -  1 ) ^ N ) ) )
4622, 45mp3an1 1264 . . . 4  |-  ( ( ( A  -  1 )  e.  CC  /\  N  e.  NN0 )  -> 
( ( 2  x.  ( A  -  1 ) ) ^ N
)  =  ( ( 2 ^ N )  x.  ( ( A  -  1 ) ^ N ) ) )
4744, 46sylan 457 . . 3  |-  ( ( A  e.  RR  /\  N  e.  NN0 )  -> 
( ( 2  x.  ( A  -  1 ) ) ^ N
)  =  ( ( 2 ^ N )  x.  ( ( A  -  1 ) ^ N ) ) )
48473adant3 975 . 2  |-  ( ( A  e.  RR  /\  N  e.  NN0  /\  2  <_  A )  ->  (
( 2  x.  ( A  -  1 ) ) ^ N )  =  ( ( 2 ^ N )  x.  ( ( A  - 
1 ) ^ N
) ) )
4943, 48breqtrd 4126 1  |-  ( ( A  e.  RR  /\  N  e.  NN0  /\  2  <_  A )  ->  ( A ^ N )  <_ 
( ( 2 ^ N )  x.  (
( A  -  1 ) ^ N ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358    /\ w3a 934    = wceq 1642    e. wcel 1710   class class class wbr 4102  (class class class)co 5942   CCcc 8822   RRcr 8823   0cc0 8824   1c1 8825    + caddc 8827    x. cmul 8829    <_ cle 8955    - cmin 9124   2c2 9882   NN0cn0 10054   ^cexp 11194
This theorem is referenced by:  faclbnd4lem1  11396
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-13 1712  ax-14 1714  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1930  ax-ext 2339  ax-sep 4220  ax-nul 4228  ax-pow 4267  ax-pr 4293  ax-un 4591  ax-cnex 8880  ax-resscn 8881  ax-1cn 8882  ax-icn 8883  ax-addcl 8884  ax-addrcl 8885  ax-mulcl 8886  ax-mulrcl 8887  ax-mulcom 8888  ax-addass 8889  ax-mulass 8890  ax-distr 8891  ax-i2m1 8892  ax-1ne0 8893  ax-1rid 8894  ax-rnegex 8895  ax-rrecex 8896  ax-cnre 8897  ax-pre-lttri 8898  ax-pre-lttrn 8899  ax-pre-ltadd 8900  ax-pre-mulgt0 8901
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-eu 2213  df-mo 2214  df-clab 2345  df-cleq 2351  df-clel 2354  df-nfc 2483  df-ne 2523  df-nel 2524  df-ral 2624  df-rex 2625  df-reu 2626  df-rab 2628  df-v 2866  df-sbc 3068  df-csb 3158  df-dif 3231  df-un 3233  df-in 3235  df-ss 3242  df-pss 3244  df-nul 3532  df-if 3642  df-pw 3703  df-sn 3722  df-pr 3723  df-tp 3724  df-op 3725  df-uni 3907  df-iun 3986  df-br 4103  df-opab 4157  df-mpt 4158  df-tr 4193  df-eprel 4384  df-id 4388  df-po 4393  df-so 4394  df-fr 4431  df-we 4433  df-ord 4474  df-on 4475  df-lim 4476  df-suc 4477  df-om 4736  df-xp 4774  df-rel 4775  df-cnv 4776  df-co 4777  df-dm 4778  df-rn 4779  df-res 4780  df-ima 4781  df-iota 5298  df-fun 5336  df-fn 5337  df-f 5338  df-f1 5339  df-fo 5340  df-f1o 5341  df-fv 5342  df-ov 5945  df-oprab 5946  df-mpt2 5947  df-2nd 6207  df-riota 6388  df-recs 6472  df-rdg 6507  df-er 6744  df-en 6949  df-dom 6950  df-sdom 6951  df-pnf 8956  df-mnf 8957  df-xr 8958  df-ltxr 8959  df-le 8960  df-sub 9126  df-neg 9127  df-nn 9834  df-2 9891  df-n0 10055  df-z 10114  df-uz 10320  df-seq 11136  df-exp 11195
  Copyright terms: Public domain W3C validator