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

Theorem ltexp2a 10952
Description: Ordering relationship for exponentiation. (Contributed by NM, 2-Aug-2006.) (Revised by Mario Carneiro, 4-Jun-2014.)
Assertion
Ref Expression
ltexp2a  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( 1  <  A  /\  M  <  N ) )  ->  ( A ^ M )  <  ( A ^ N ) )

Proof of Theorem ltexp2a
StepHypRef Expression
1 simpl1 1027 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( 1  <  A  /\  M  <  N ) )  ->  A  e.  RR )
2 0red 8274 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( 1  <  A  /\  M  <  N ) )  ->  0  e.  RR )
3 1red 8288 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( 1  <  A  /\  M  <  N ) )  ->  1  e.  RR )
4 0lt1 8399 . . . . . . . . 9  |-  0  <  1
54a1i 9 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( 1  <  A  /\  M  <  N ) )  ->  0  <  1 )
6 simprl 531 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( 1  <  A  /\  M  <  N ) )  ->  1  <  A )
72, 3, 1, 5, 6lttrd 8398 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( 1  <  A  /\  M  <  N ) )  ->  0  <  A )
81, 7elrpd 10025 . . . . . 6  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( 1  <  A  /\  M  <  N ) )  ->  A  e.  RR+ )
9 simpl2 1028 . . . . . 6  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( 1  <  A  /\  M  <  N ) )  ->  M  e.  ZZ )
10 rpexpcl 10919 . . . . . 6  |-  ( ( A  e.  RR+  /\  M  e.  ZZ )  ->  ( A ^ M )  e.  RR+ )
118, 9, 10syl2anc 411 . . . . 5  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( 1  <  A  /\  M  <  N ) )  ->  ( A ^ M )  e.  RR+ )
1211rpred 10028 . . . 4  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( 1  <  A  /\  M  <  N ) )  ->  ( A ^ M )  e.  RR )
1312recnd 8301 . . 3  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( 1  <  A  /\  M  <  N ) )  ->  ( A ^ M )  e.  CC )
1413mullidd 8291 . 2  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( 1  <  A  /\  M  <  N ) )  ->  ( 1  x.  ( A ^ M ) )  =  ( A ^ M
) )
15 simprr 533 . . . . . 6  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( 1  <  A  /\  M  <  N ) )  ->  M  <  N )
16 simpl3 1029 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( 1  <  A  /\  M  <  N ) )  ->  N  e.  ZZ )
17 znnsub 9628 . . . . . . 7  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( M  <  N  <->  ( N  -  M )  e.  NN ) )
189, 16, 17syl2anc 411 . . . . . 6  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( 1  <  A  /\  M  <  N ) )  ->  ( M  <  N  <->  ( N  -  M )  e.  NN ) )
1915, 18mpbid 147 . . . . 5  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( 1  <  A  /\  M  <  N ) )  ->  ( N  -  M )  e.  NN )
20 expgt1 10938 . . . . 5  |-  ( ( A  e.  RR  /\  ( N  -  M
)  e.  NN  /\  1  <  A )  -> 
1  <  ( A ^ ( N  -  M ) ) )
211, 19, 6, 20syl3anc 1274 . . . 4  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( 1  <  A  /\  M  <  N ) )  ->  1  <  ( A ^ ( N  -  M ) ) )
221recnd 8301 . . . . 5  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( 1  <  A  /\  M  <  N ) )  ->  A  e.  CC )
231, 7gt0ap0d 8902 . . . . 5  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( 1  <  A  /\  M  <  N ) )  ->  A #  0
)
24 expsubap 10948 . . . . 5  |-  ( ( ( A  e.  CC  /\  A #  0 )  /\  ( N  e.  ZZ  /\  M  e.  ZZ ) )  ->  ( A ^ ( N  -  M ) )  =  ( ( A ^ N )  /  ( A ^ M ) ) )
2522, 23, 16, 9, 24syl22anc 1275 . . . 4  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( 1  <  A  /\  M  <  N ) )  ->  ( A ^ ( N  -  M ) )  =  ( ( A ^ N )  /  ( A ^ M ) ) )
2621, 25breqtrd 4134 . . 3  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( 1  <  A  /\  M  <  N ) )  ->  1  <  ( ( A ^ N
)  /  ( A ^ M ) ) )
27 rpexpcl 10919 . . . . . 6  |-  ( ( A  e.  RR+  /\  N  e.  ZZ )  ->  ( A ^ N )  e.  RR+ )
288, 16, 27syl2anc 411 . . . . 5  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( 1  <  A  /\  M  <  N ) )  ->  ( A ^ N )  e.  RR+ )
2928rpred 10028 . . . 4  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( 1  <  A  /\  M  <  N ) )  ->  ( A ^ N )  e.  RR )
303, 29, 11ltmuldivd 10076 . . 3  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( 1  <  A  /\  M  <  N ) )  ->  ( (
1  x.  ( A ^ M ) )  <  ( A ^ N )  <->  1  <  ( ( A ^ N
)  /  ( A ^ M ) ) ) )
3126, 30mpbird 167 . 2  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( 1  <  A  /\  M  <  N ) )  ->  ( 1  x.  ( A ^ M ) )  < 
( A ^ N
) )
3214, 31eqbrtrrd 4132 1  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  ( 1  <  A  /\  M  <  N ) )  ->  ( A ^ M )  <  ( A ^ N ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1005    = wceq 1398    e. wcel 2203   class class class wbr 4108  (class class class)co 6049   CCcc 8124   RRcr 8125   0cc0 8126   1c1 8127    x. cmul 8131    < clt 8307    - cmin 8443   # cap 8854    / cdiv 8945   NNcn 9236   ZZcz 9576   RR+crp 9985   ^cexp 10899
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4224  ax-sep 4227  ax-nul 4235  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-setind 4658  ax-iinf 4709  ax-cnex 8217  ax-resscn 8218  ax-1cn 8219  ax-1re 8220  ax-icn 8221  ax-addcl 8222  ax-addrcl 8223  ax-mulcl 8224  ax-mulrcl 8225  ax-addcom 8226  ax-mulcom 8227  ax-addass 8228  ax-mulass 8229  ax-distr 8230  ax-i2m1 8231  ax-0lt1 8232  ax-1rid 8233  ax-0id 8234  ax-rnegex 8235  ax-precex 8236  ax-cnre 8237  ax-pre-ltirr 8238  ax-pre-ltwlin 8239  ax-pre-lttrn 8240  ax-pre-apti 8241  ax-pre-ltadd 8242  ax-pre-mulgt0 8243  ax-pre-mulext 8244
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rmo 2528  df-rab 2529  df-v 2814  df-sbc 3042  df-csb 3138  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-nul 3508  df-if 3620  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-int 3949  df-iun 3992  df-br 4109  df-opab 4171  df-mpt 4172  df-tr 4208  df-id 4413  df-po 4416  df-iso 4417  df-iord 4486  df-on 4488  df-ilim 4489  df-suc 4491  df-iom 4712  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-ima 4761  df-iota 5311  df-fun 5353  df-fn 5354  df-f 5355  df-f1 5356  df-fo 5357  df-f1o 5358  df-fv 5359  df-riota 6002  df-ov 6052  df-oprab 6053  df-mpo 6054  df-1st 6333  df-2nd 6334  df-recs 6535  df-frec 6621  df-pnf 8309  df-mnf 8310  df-xr 8311  df-ltxr 8312  df-le 8313  df-sub 8445  df-neg 8446  df-reap 8848  df-ap 8855  df-div 8946  df-inn 9237  df-n0 9496  df-z 9577  df-uz 9853  df-rp 9986  df-seqfrec 10809  df-exp 10900
This theorem is referenced by:  expnass  11006  nn0ltexp2  11070  expcanlem  11076  perfectlem2  15860
  Copyright terms: Public domain W3C validator