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

Theorem prmexpb 12852
Description: Two positive prime powers are equal iff the primes and the powers are equal. (Contributed by Paul Chapman, 30-Nov-2012.)
Assertion
Ref Expression
prmexpb  |-  ( ( ( P  e.  Prime  /\  Q  e.  Prime )  /\  ( M  e.  NN  /\  N  e.  NN ) )  ->  ( ( P ^ M )  =  ( Q ^ N
)  <->  ( P  =  Q  /\  M  =  N ) ) )

Proof of Theorem prmexpb
StepHypRef Expression
1 prmz 12812 . . . . . . . 8  |-  ( P  e.  Prime  ->  P  e.  ZZ )
21adantr 276 . . . . . . 7  |-  ( ( P  e.  Prime  /\  Q  e.  Prime )  ->  P  e.  ZZ )
323ad2ant1 1045 . . . . . 6  |-  ( ( ( P  e.  Prime  /\  Q  e.  Prime )  /\  ( M  e.  NN  /\  N  e.  NN )  /\  ( P ^ M )  =  ( Q ^ N ) )  ->  P  e.  ZZ )
4 simp2l 1050 . . . . . 6  |-  ( ( ( P  e.  Prime  /\  Q  e.  Prime )  /\  ( M  e.  NN  /\  N  e.  NN )  /\  ( P ^ M )  =  ( Q ^ N ) )  ->  M  e.  NN )
5 iddvdsexp 12505 . . . . . 6  |-  ( ( P  e.  ZZ  /\  M  e.  NN )  ->  P  ||  ( P ^ M ) )
63, 4, 5syl2anc 411 . . . . 5  |-  ( ( ( P  e.  Prime  /\  Q  e.  Prime )  /\  ( M  e.  NN  /\  N  e.  NN )  /\  ( P ^ M )  =  ( Q ^ N ) )  ->  P  ||  ( P ^ M ) )
7 breq2 4115 . . . . . . 7  |-  ( ( P ^ M )  =  ( Q ^ N )  ->  ( P  ||  ( P ^ M )  <->  P  ||  ( Q ^ N ) ) )
873ad2ant3 1047 . . . . . 6  |-  ( ( ( P  e.  Prime  /\  Q  e.  Prime )  /\  ( M  e.  NN  /\  N  e.  NN )  /\  ( P ^ M )  =  ( Q ^ N ) )  ->  ( P  ||  ( P ^ M
)  <->  P  ||  ( Q ^ N ) ) )
9 simp1l 1048 . . . . . . 7  |-  ( ( ( P  e.  Prime  /\  Q  e.  Prime )  /\  ( M  e.  NN  /\  N  e.  NN )  /\  ( P ^ M )  =  ( Q ^ N ) )  ->  P  e.  Prime )
10 simp1r 1049 . . . . . . 7  |-  ( ( ( P  e.  Prime  /\  Q  e.  Prime )  /\  ( M  e.  NN  /\  N  e.  NN )  /\  ( P ^ M )  =  ( Q ^ N ) )  ->  Q  e.  Prime )
11 simp2r 1051 . . . . . . 7  |-  ( ( ( P  e.  Prime  /\  Q  e.  Prime )  /\  ( M  e.  NN  /\  N  e.  NN )  /\  ( P ^ M )  =  ( Q ^ N ) )  ->  N  e.  NN )
12 prmdvdsexpb 12850 . . . . . . 7  |-  ( ( P  e.  Prime  /\  Q  e.  Prime  /\  N  e.  NN )  ->  ( P 
||  ( Q ^ N )  <->  P  =  Q ) )
139, 10, 11, 12syl3anc 1274 . . . . . 6  |-  ( ( ( P  e.  Prime  /\  Q  e.  Prime )  /\  ( M  e.  NN  /\  N  e.  NN )  /\  ( P ^ M )  =  ( Q ^ N ) )  ->  ( P  ||  ( Q ^ N
)  <->  P  =  Q
) )
148, 13bitrd 188 . . . . 5  |-  ( ( ( P  e.  Prime  /\  Q  e.  Prime )  /\  ( M  e.  NN  /\  N  e.  NN )  /\  ( P ^ M )  =  ( Q ^ N ) )  ->  ( P  ||  ( P ^ M
)  <->  P  =  Q
) )
156, 14mpbid 147 . . . 4  |-  ( ( ( P  e.  Prime  /\  Q  e.  Prime )  /\  ( M  e.  NN  /\  N  e.  NN )  /\  ( P ^ M )  =  ( Q ^ N ) )  ->  P  =  Q )
163zred 9703 . . . . 5  |-  ( ( ( P  e.  Prime  /\  Q  e.  Prime )  /\  ( M  e.  NN  /\  N  e.  NN )  /\  ( P ^ M )  =  ( Q ^ N ) )  ->  P  e.  RR )
174nnzd 9702 . . . . 5  |-  ( ( ( P  e.  Prime  /\  Q  e.  Prime )  /\  ( M  e.  NN  /\  N  e.  NN )  /\  ( P ^ M )  =  ( Q ^ N ) )  ->  M  e.  ZZ )
1811nnzd 9702 . . . . 5  |-  ( ( ( P  e.  Prime  /\  Q  e.  Prime )  /\  ( M  e.  NN  /\  N  e.  NN )  /\  ( P ^ M )  =  ( Q ^ N ) )  ->  N  e.  ZZ )
19 prmgt1 12833 . . . . . . 7  |-  ( P  e.  Prime  ->  1  < 
P )
2019ad2antrr 488 . . . . . 6  |-  ( ( ( P  e.  Prime  /\  Q  e.  Prime )  /\  ( M  e.  NN  /\  N  e.  NN ) )  ->  1  <  P )
21203adant3 1044 . . . . 5  |-  ( ( ( P  e.  Prime  /\  Q  e.  Prime )  /\  ( M  e.  NN  /\  N  e.  NN )  /\  ( P ^ M )  =  ( Q ^ N ) )  ->  1  <  P )
22 simp3 1026 . . . . . 6  |-  ( ( ( P  e.  Prime  /\  Q  e.  Prime )  /\  ( M  e.  NN  /\  N  e.  NN )  /\  ( P ^ M )  =  ( Q ^ N ) )  ->  ( P ^ M )  =  ( Q ^ N ) )
2315oveq1d 6067 . . . . . 6  |-  ( ( ( P  e.  Prime  /\  Q  e.  Prime )  /\  ( M  e.  NN  /\  N  e.  NN )  /\  ( P ^ M )  =  ( Q ^ N ) )  ->  ( P ^ N )  =  ( Q ^ N ) )
2422, 23eqtr4d 2270 . . . . 5  |-  ( ( ( P  e.  Prime  /\  Q  e.  Prime )  /\  ( M  e.  NN  /\  N  e.  NN )  /\  ( P ^ M )  =  ( Q ^ N ) )  ->  ( P ^ M )  =  ( P ^ N ) )
2516, 17, 18, 21, 24expcand 11083 . . . 4  |-  ( ( ( P  e.  Prime  /\  Q  e.  Prime )  /\  ( M  e.  NN  /\  N  e.  NN )  /\  ( P ^ M )  =  ( Q ^ N ) )  ->  M  =  N )
2615, 25jca 306 . . 3  |-  ( ( ( P  e.  Prime  /\  Q  e.  Prime )  /\  ( M  e.  NN  /\  N  e.  NN )  /\  ( P ^ M )  =  ( Q ^ N ) )  ->  ( P  =  Q  /\  M  =  N ) )
27263expia 1232 . 2  |-  ( ( ( P  e.  Prime  /\  Q  e.  Prime )  /\  ( M  e.  NN  /\  N  e.  NN ) )  ->  ( ( P ^ M )  =  ( Q ^ N
)  ->  ( P  =  Q  /\  M  =  N ) ) )
28 oveq12 6061 . 2  |-  ( ( P  =  Q  /\  M  =  N )  ->  ( P ^ M
)  =  ( Q ^ N ) )
2927, 28impbid1 142 1  |-  ( ( ( P  e.  Prime  /\  Q  e.  Prime )  /\  ( M  e.  NN  /\  N  e.  NN ) )  ->  ( ( P ^ M )  =  ( Q ^ N
)  <->  ( P  =  Q  /\  M  =  N ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1005    = wceq 1398    e. wcel 2205   class class class wbr 4111  (class class class)co 6052   1c1 8130    < clt 8310   NNcn 9239   ZZcz 9579   ^cexp 10904    || cdvds 12477   Primecprime 12808
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 2207  ax-14 2208  ax-ext 2216  ax-coll 4227  ax-sep 4230  ax-nul 4238  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661  ax-iinf 4712  ax-cnex 8220  ax-resscn 8221  ax-1cn 8222  ax-1re 8223  ax-icn 8224  ax-addcl 8225  ax-addrcl 8226  ax-mulcl 8227  ax-mulrcl 8228  ax-addcom 8229  ax-mulcom 8230  ax-addass 8231  ax-mulass 8232  ax-distr 8233  ax-i2m1 8234  ax-0lt1 8235  ax-1rid 8236  ax-0id 8237  ax-rnegex 8238  ax-precex 8239  ax-cnre 8240  ax-pre-ltirr 8241  ax-pre-ltwlin 8242  ax-pre-lttrn 8243  ax-pre-apti 8244  ax-pre-ltadd 8245  ax-pre-mulgt0 8246  ax-pre-mulext 8247  ax-arch 8248  ax-caucvg 8249
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 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3045  df-csb 3141  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-nul 3511  df-if 3623  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-int 3952  df-iun 3995  df-br 4112  df-opab 4174  df-mpt 4175  df-tr 4211  df-id 4416  df-po 4419  df-iso 4420  df-iord 4489  df-on 4491  df-ilim 4492  df-suc 4494  df-iom 4715  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-iota 5314  df-fun 5356  df-fn 5357  df-f 5358  df-f1 5359  df-fo 5360  df-f1o 5361  df-fv 5362  df-riota 6005  df-ov 6055  df-oprab 6056  df-mpo 6057  df-1st 6336  df-2nd 6337  df-recs 6538  df-frec 6624  df-1o 6649  df-2o 6650  df-er 6769  df-en 6978  df-sup 7277  df-pnf 8312  df-mnf 8313  df-xr 8314  df-ltxr 8315  df-le 8316  df-sub 8448  df-neg 8449  df-reap 8851  df-ap 8858  df-div 8949  df-inn 9240  df-2 9298  df-3 9299  df-4 9300  df-n0 9499  df-z 9580  df-uz 9857  df-q 9955  df-rp 9990  df-fz 10346  df-fzo 10481  df-fl 10634  df-mod 10689  df-seqfrec 10814  df-exp 10905  df-cj 11531  df-re 11532  df-im 11533  df-rsqrt 11687  df-abs 11688  df-dvds 12478  df-gcd 12654  df-prm 12809
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator