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

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

Proof of Theorem expcan
StepHypRef Expression
1 simpl1 1027 . . . . 5  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  1  <  A )  ->  A  e.  RR )
2 simpl2 1028 . . . . 5  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  1  <  A )  ->  M  e.  ZZ )
3 simpl3 1029 . . . . 5  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  1  <  A )  ->  N  e.  ZZ )
4 simpr 110 . . . . 5  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  1  <  A )  ->  1  <  A
)
51, 2, 3, 4expcanlem 11077 . . . 4  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  1  <  A )  ->  ( ( A ^ M )  <_ 
( A ^ N
)  ->  M  <_  N ) )
61, 3, 2, 4expcanlem 11077 . . . 4  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  1  <  A )  ->  ( ( A ^ N )  <_ 
( A ^ M
)  ->  N  <_  M ) )
75, 6anim12d 335 . . 3  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  1  <  A )  ->  ( ( ( A ^ M )  <_  ( A ^ N )  /\  ( A ^ N )  <_ 
( A ^ M
) )  ->  ( M  <_  N  /\  N  <_  M ) ) )
8 0red 8275 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  1  <  A )  ->  0  e.  RR )
9 1red 8289 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  1  <  A )  ->  1  e.  RR )
10 0lt1 8400 . . . . . . . 8  |-  0  <  1
1110a1i 9 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  1  <  A )  ->  0  <  1
)
128, 9, 1, 11, 4lttrd 8399 . . . . . 6  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  1  <  A )  ->  0  <  A
)
131, 12gt0ap0d 8903 . . . . 5  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  1  <  A )  ->  A #  0 )
141, 13, 2reexpclzapd 11060 . . . 4  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  1  <  A )  ->  ( A ^ M )  e.  RR )
151, 13, 3reexpclzapd 11060 . . . 4  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  1  <  A )  ->  ( A ^ N )  e.  RR )
1614, 15letri3d 8389 . . 3  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  1  <  A )  ->  ( ( A ^ M )  =  ( A ^ N
)  <->  ( ( A ^ M )  <_ 
( A ^ N
)  /\  ( A ^ N )  <_  ( A ^ M ) ) ) )
172zred 9700 . . . 4  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  1  <  A )  ->  M  e.  RR )
183zred 9700 . . . 4  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  1  <  A )  ->  N  e.  RR )
1917, 18letri3d 8389 . . 3  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  1  <  A )  ->  ( M  =  N  <->  ( M  <_  N  /\  N  <_  M
) ) )
207, 16, 193imtr4d 203 . 2  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  1  <  A )  ->  ( ( A ^ M )  =  ( A ^ N
)  ->  M  =  N ) )
21 oveq2 6058 . 2  |-  ( M  =  N  ->  ( A ^ M )  =  ( A ^ N
) )
2220, 21impbid1 142 1  |-  ( ( ( A  e.  RR  /\  M  e.  ZZ  /\  N  e.  ZZ )  /\  1  <  A )  ->  ( ( A ^ M )  =  ( A ^ N
)  <->  M  =  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 4109  (class class class)co 6050   RRcr 8126   0cc0 8127   1c1 8128    < clt 8308    <_ cle 8309   ZZcz 9577   ^cexp 10900
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 4225  ax-sep 4228  ax-nul 4236  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-iinf 4710  ax-cnex 8218  ax-resscn 8219  ax-1cn 8220  ax-1re 8221  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-mulrcl 8226  ax-addcom 8227  ax-mulcom 8228  ax-addass 8229  ax-mulass 8230  ax-distr 8231  ax-i2m1 8232  ax-0lt1 8233  ax-1rid 8234  ax-0id 8235  ax-rnegex 8236  ax-precex 8237  ax-cnre 8238  ax-pre-ltirr 8239  ax-pre-ltwlin 8240  ax-pre-lttrn 8241  ax-pre-apti 8242  ax-pre-ltadd 8243  ax-pre-mulgt0 8244  ax-pre-mulext 8245
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 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-if 3621  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-tr 4209  df-id 4414  df-po 4417  df-iso 4418  df-iord 4487  df-on 4489  df-ilim 4490  df-suc 4492  df-iom 4713  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-1st 6334  df-2nd 6335  df-recs 6536  df-frec 6622  df-pnf 8310  df-mnf 8311  df-xr 8312  df-ltxr 8313  df-le 8314  df-sub 8446  df-neg 8447  df-reap 8849  df-ap 8856  df-div 8947  df-inn 9238  df-n0 9497  df-z 9578  df-uz 9854  df-rp 9987  df-seqfrec 10810  df-exp 10901
This theorem is referenced by:  expcand  11079
  Copyright terms: Public domain W3C validator