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

Theorem expnlbnd 10916
Description: The reciprocal of exponentiation with a base greater than 1 has no positive lower bound. (Contributed by NM, 18-Jul-2008.)
Assertion
Ref Expression
expnlbnd  |-  ( ( A  e.  RR+  /\  B  e.  RR  /\  1  < 
B )  ->  E. k  e.  NN  ( 1  / 
( B ^ k
) )  <  A
)
Distinct variable groups:    A, k    B, k

Proof of Theorem expnlbnd
StepHypRef Expression
1 rpre 9885 . . . 4  |-  ( A  e.  RR+  ->  A  e.  RR )
2 rpap0 9895 . . . 4  |-  ( A  e.  RR+  ->  A #  0 )
31, 2rerecclapd 9004 . . 3  |-  ( A  e.  RR+  ->  ( 1  /  A )  e.  RR )
4 expnbnd 10915 . . 3  |-  ( ( ( 1  /  A
)  e.  RR  /\  B  e.  RR  /\  1  <  B )  ->  E. k  e.  NN  ( 1  /  A )  <  ( B ^ k ) )
53, 4syl3an1 1304 . 2  |-  ( ( A  e.  RR+  /\  B  e.  RR  /\  1  < 
B )  ->  E. k  e.  NN  ( 1  /  A )  <  ( B ^ k ) )
6 rpregt0 9892 . . . . . 6  |-  ( A  e.  RR+  ->  ( A  e.  RR  /\  0  <  A ) )
763ad2ant1 1042 . . . . 5  |-  ( ( A  e.  RR+  /\  B  e.  RR  /\  1  < 
B )  ->  ( A  e.  RR  /\  0  <  A ) )
87adantr 276 . . . 4  |-  ( ( ( A  e.  RR+  /\  B  e.  RR  /\  1  <  B )  /\  k  e.  NN )  ->  ( A  e.  RR  /\  0  <  A ) )
9 nnnn0 9399 . . . . . . . 8  |-  ( k  e.  NN  ->  k  e.  NN0 )
10 reexpcl 10808 . . . . . . . 8  |-  ( ( B  e.  RR  /\  k  e.  NN0 )  -> 
( B ^ k
)  e.  RR )
119, 10sylan2 286 . . . . . . 7  |-  ( ( B  e.  RR  /\  k  e.  NN )  ->  ( B ^ k
)  e.  RR )
1211adantlr 477 . . . . . 6  |-  ( ( ( B  e.  RR  /\  1  <  B )  /\  k  e.  NN )  ->  ( B ^
k )  e.  RR )
13 simpll 527 . . . . . . 7  |-  ( ( ( B  e.  RR  /\  1  <  B )  /\  k  e.  NN )  ->  B  e.  RR )
14 nnz 9488 . . . . . . . 8  |-  ( k  e.  NN  ->  k  e.  ZZ )
1514adantl 277 . . . . . . 7  |-  ( ( ( B  e.  RR  /\  1  <  B )  /\  k  e.  NN )  ->  k  e.  ZZ )
16 0lt1 8296 . . . . . . . . . 10  |-  0  <  1
17 0re 8169 . . . . . . . . . . 11  |-  0  e.  RR
18 1re 8168 . . . . . . . . . . 11  |-  1  e.  RR
19 lttr 8243 . . . . . . . . . . 11  |-  ( ( 0  e.  RR  /\  1  e.  RR  /\  B  e.  RR )  ->  (
( 0  <  1  /\  1  <  B )  ->  0  <  B
) )
2017, 18, 19mp3an12 1361 . . . . . . . . . 10  |-  ( B  e.  RR  ->  (
( 0  <  1  /\  1  <  B )  ->  0  <  B
) )
2116, 20mpani 430 . . . . . . . . 9  |-  ( B  e.  RR  ->  (
1  <  B  ->  0  <  B ) )
2221imp 124 . . . . . . . 8  |-  ( ( B  e.  RR  /\  1  <  B )  -> 
0  <  B )
2322adantr 276 . . . . . . 7  |-  ( ( ( B  e.  RR  /\  1  <  B )  /\  k  e.  NN )  ->  0  <  B
)
24 expgt0 10824 . . . . . . 7  |-  ( ( B  e.  RR  /\  k  e.  ZZ  /\  0  <  B )  ->  0  <  ( B ^ k
) )
2513, 15, 23, 24syl3anc 1271 . . . . . 6  |-  ( ( ( B  e.  RR  /\  1  <  B )  /\  k  e.  NN )  ->  0  <  ( B ^ k ) )
2612, 25jca 306 . . . . 5  |-  ( ( ( B  e.  RR  /\  1  <  B )  /\  k  e.  NN )  ->  ( ( B ^ k )  e.  RR  /\  0  < 
( B ^ k
) ) )
27263adantl1 1177 . . . 4  |-  ( ( ( A  e.  RR+  /\  B  e.  RR  /\  1  <  B )  /\  k  e.  NN )  ->  ( ( B ^
k )  e.  RR  /\  0  <  ( B ^ k ) ) )
28 ltrec1 9058 . . . 4  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( ( B ^ k )  e.  RR  /\  0  < 
( B ^ k
) ) )  -> 
( ( 1  /  A )  <  ( B ^ k )  <->  ( 1  /  ( B ^
k ) )  < 
A ) )
298, 27, 28syl2anc 411 . . 3  |-  ( ( ( A  e.  RR+  /\  B  e.  RR  /\  1  <  B )  /\  k  e.  NN )  ->  ( ( 1  /  A )  <  ( B ^ k )  <->  ( 1  /  ( B ^
k ) )  < 
A ) )
3029rexbidva 2527 . 2  |-  ( ( A  e.  RR+  /\  B  e.  RR  /\  1  < 
B )  ->  ( E. k  e.  NN  ( 1  /  A
)  <  ( B ^ k )  <->  E. k  e.  NN  ( 1  / 
( B ^ k
) )  <  A
) )
315, 30mpbid 147 1  |-  ( ( A  e.  RR+  /\  B  e.  RR  /\  1  < 
B )  ->  E. k  e.  NN  ( 1  / 
( B ^ k
) )  <  A
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1002    e. wcel 2200   E.wrex 2509   class class class wbr 4086  (class class class)co 6013   RRcr 8021   0cc0 8022   1c1 8023    < clt 8204    / cdiv 8842   NNcn 9133   NN0cn0 9392   ZZcz 9469   RR+crp 9878   ^cexp 10790
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4202  ax-sep 4205  ax-nul 4213  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-iinf 4684  ax-cnex 8113  ax-resscn 8114  ax-1cn 8115  ax-1re 8116  ax-icn 8117  ax-addcl 8118  ax-addrcl 8119  ax-mulcl 8120  ax-mulrcl 8121  ax-addcom 8122  ax-mulcom 8123  ax-addass 8124  ax-mulass 8125  ax-distr 8126  ax-i2m1 8127  ax-0lt1 8128  ax-1rid 8129  ax-0id 8130  ax-rnegex 8131  ax-precex 8132  ax-cnre 8133  ax-pre-ltirr 8134  ax-pre-ltwlin 8135  ax-pre-lttrn 8136  ax-pre-apti 8137  ax-pre-ltadd 8138  ax-pre-mulgt0 8139  ax-pre-mulext 8140  ax-arch 8141
This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-if 3604  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-tr 4186  df-id 4388  df-po 4391  df-iso 4392  df-iord 4461  df-on 4463  df-ilim 4464  df-suc 4466  df-iom 4687  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-1st 6298  df-2nd 6299  df-recs 6466  df-frec 6552  df-pnf 8206  df-mnf 8207  df-xr 8208  df-ltxr 8209  df-le 8210  df-sub 8342  df-neg 8343  df-reap 8745  df-ap 8752  df-div 8843  df-inn 9134  df-n0 9393  df-z 9470  df-uz 9746  df-rp 9879  df-seqfrec 10700  df-exp 10791
This theorem is referenced by:  expnlbnd2  10917
  Copyright terms: Public domain W3C validator