| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > prmexpb | GIF version | ||
| Description: Two positive prime powers are equal iff the primes and the powers are equal. (Contributed by Paul Chapman, 30-Nov-2012.) |
| Ref | Expression |
|---|---|
| prmexpb | ⊢ (((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ)) → ((𝑃↑𝑀) = (𝑄↑𝑁) ↔ (𝑃 = 𝑄 ∧ 𝑀 = 𝑁))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | prmz 12703 | . . . . . . . 8 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℤ) | |
| 2 | 1 | adantr 276 | . . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) → 𝑃 ∈ ℤ) |
| 3 | 2 | 3ad2ant1 1044 | . . . . . 6 ⊢ (((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝑃↑𝑀) = (𝑄↑𝑁)) → 𝑃 ∈ ℤ) |
| 4 | simp2l 1049 | . . . . . 6 ⊢ (((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝑃↑𝑀) = (𝑄↑𝑁)) → 𝑀 ∈ ℕ) | |
| 5 | iddvdsexp 12396 | . . . . . 6 ⊢ ((𝑃 ∈ ℤ ∧ 𝑀 ∈ ℕ) → 𝑃 ∥ (𝑃↑𝑀)) | |
| 6 | 3, 4, 5 | syl2anc 411 | . . . . 5 ⊢ (((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝑃↑𝑀) = (𝑄↑𝑁)) → 𝑃 ∥ (𝑃↑𝑀)) |
| 7 | breq2 4091 | . . . . . . 7 ⊢ ((𝑃↑𝑀) = (𝑄↑𝑁) → (𝑃 ∥ (𝑃↑𝑀) ↔ 𝑃 ∥ (𝑄↑𝑁))) | |
| 8 | 7 | 3ad2ant3 1046 | . . . . . 6 ⊢ (((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝑃↑𝑀) = (𝑄↑𝑁)) → (𝑃 ∥ (𝑃↑𝑀) ↔ 𝑃 ∥ (𝑄↑𝑁))) |
| 9 | simp1l 1047 | . . . . . . 7 ⊢ (((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝑃↑𝑀) = (𝑄↑𝑁)) → 𝑃 ∈ ℙ) | |
| 10 | simp1r 1048 | . . . . . . 7 ⊢ (((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝑃↑𝑀) = (𝑄↑𝑁)) → 𝑄 ∈ ℙ) | |
| 11 | simp2r 1050 | . . . . . . 7 ⊢ (((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝑃↑𝑀) = (𝑄↑𝑁)) → 𝑁 ∈ ℕ) | |
| 12 | prmdvdsexpb 12741 | . . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ ∧ 𝑁 ∈ ℕ) → (𝑃 ∥ (𝑄↑𝑁) ↔ 𝑃 = 𝑄)) | |
| 13 | 9, 10, 11, 12 | syl3anc 1273 | . . . . . 6 ⊢ (((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝑃↑𝑀) = (𝑄↑𝑁)) → (𝑃 ∥ (𝑄↑𝑁) ↔ 𝑃 = 𝑄)) |
| 14 | 8, 13 | bitrd 188 | . . . . 5 ⊢ (((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝑃↑𝑀) = (𝑄↑𝑁)) → (𝑃 ∥ (𝑃↑𝑀) ↔ 𝑃 = 𝑄)) |
| 15 | 6, 14 | mpbid 147 | . . . 4 ⊢ (((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝑃↑𝑀) = (𝑄↑𝑁)) → 𝑃 = 𝑄) |
| 16 | 3 | zred 9604 | . . . . 5 ⊢ (((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝑃↑𝑀) = (𝑄↑𝑁)) → 𝑃 ∈ ℝ) |
| 17 | 4 | nnzd 9603 | . . . . 5 ⊢ (((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝑃↑𝑀) = (𝑄↑𝑁)) → 𝑀 ∈ ℤ) |
| 18 | 11 | nnzd 9603 | . . . . 5 ⊢ (((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝑃↑𝑀) = (𝑄↑𝑁)) → 𝑁 ∈ ℤ) |
| 19 | prmgt1 12724 | . . . . . . 7 ⊢ (𝑃 ∈ ℙ → 1 < 𝑃) | |
| 20 | 19 | ad2antrr 488 | . . . . . 6 ⊢ (((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ)) → 1 < 𝑃) |
| 21 | 20 | 3adant3 1043 | . . . . 5 ⊢ (((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝑃↑𝑀) = (𝑄↑𝑁)) → 1 < 𝑃) |
| 22 | simp3 1025 | . . . . . 6 ⊢ (((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝑃↑𝑀) = (𝑄↑𝑁)) → (𝑃↑𝑀) = (𝑄↑𝑁)) | |
| 23 | 15 | oveq1d 6035 | . . . . . 6 ⊢ (((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝑃↑𝑀) = (𝑄↑𝑁)) → (𝑃↑𝑁) = (𝑄↑𝑁)) |
| 24 | 22, 23 | eqtr4d 2266 | . . . . 5 ⊢ (((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝑃↑𝑀) = (𝑄↑𝑁)) → (𝑃↑𝑀) = (𝑃↑𝑁)) |
| 25 | 16, 17, 18, 21, 24 | expcand 10982 | . . . 4 ⊢ (((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝑃↑𝑀) = (𝑄↑𝑁)) → 𝑀 = 𝑁) |
| 26 | 15, 25 | jca 306 | . . 3 ⊢ (((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) ∧ (𝑃↑𝑀) = (𝑄↑𝑁)) → (𝑃 = 𝑄 ∧ 𝑀 = 𝑁)) |
| 27 | 26 | 3expia 1231 | . 2 ⊢ (((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ)) → ((𝑃↑𝑀) = (𝑄↑𝑁) → (𝑃 = 𝑄 ∧ 𝑀 = 𝑁))) |
| 28 | oveq12 6029 | . 2 ⊢ ((𝑃 = 𝑄 ∧ 𝑀 = 𝑁) → (𝑃↑𝑀) = (𝑄↑𝑁)) | |
| 29 | 27, 28 | impbid1 142 | 1 ⊢ (((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ)) → ((𝑃↑𝑀) = (𝑄↑𝑁) ↔ (𝑃 = 𝑄 ∧ 𝑀 = 𝑁))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1004 = wceq 1397 ∈ wcel 2201 class class class wbr 4087 (class class class)co 6020 1c1 8035 < clt 8216 ℕcn 9145 ℤcz 9481 ↑cexp 10803 ∥ cdvds 12368 ℙcprime 12699 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2203 ax-14 2204 ax-ext 2212 ax-coll 4203 ax-sep 4206 ax-nul 4214 ax-pow 4263 ax-pr 4298 ax-un 4529 ax-setind 4634 ax-iinf 4685 ax-cnex 8125 ax-resscn 8126 ax-1cn 8127 ax-1re 8128 ax-icn 8129 ax-addcl 8130 ax-addrcl 8131 ax-mulcl 8132 ax-mulrcl 8133 ax-addcom 8134 ax-mulcom 8135 ax-addass 8136 ax-mulass 8137 ax-distr 8138 ax-i2m1 8139 ax-0lt1 8140 ax-1rid 8141 ax-0id 8142 ax-rnegex 8143 ax-precex 8144 ax-cnre 8145 ax-pre-ltirr 8146 ax-pre-ltwlin 8147 ax-pre-lttrn 8148 ax-pre-apti 8149 ax-pre-ltadd 8150 ax-pre-mulgt0 8151 ax-pre-mulext 8152 ax-arch 8153 ax-caucvg 8154 |
| This theorem depends on definitions: df-bi 117 df-dc 842 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1810 df-eu 2081 df-mo 2082 df-clab 2217 df-cleq 2223 df-clel 2226 df-nfc 2362 df-ne 2402 df-nel 2497 df-ral 2514 df-rex 2515 df-reu 2516 df-rmo 2517 df-rab 2518 df-v 2803 df-sbc 3031 df-csb 3127 df-dif 3201 df-un 3203 df-in 3205 df-ss 3212 df-nul 3494 df-if 3605 df-pw 3653 df-sn 3674 df-pr 3675 df-op 3677 df-uni 3893 df-int 3928 df-iun 3971 df-br 4088 df-opab 4150 df-mpt 4151 df-tr 4187 df-id 4389 df-po 4392 df-iso 4393 df-iord 4462 df-on 4464 df-ilim 4465 df-suc 4467 df-iom 4688 df-xp 4730 df-rel 4731 df-cnv 4732 df-co 4733 df-dm 4734 df-rn 4735 df-res 4736 df-ima 4737 df-iota 5285 df-fun 5327 df-fn 5328 df-f 5329 df-f1 5330 df-fo 5331 df-f1o 5332 df-fv 5333 df-riota 5973 df-ov 6023 df-oprab 6024 df-mpo 6025 df-1st 6305 df-2nd 6306 df-recs 6473 df-frec 6559 df-1o 6584 df-2o 6585 df-er 6704 df-en 6912 df-sup 7185 df-pnf 8218 df-mnf 8219 df-xr 8220 df-ltxr 8221 df-le 8222 df-sub 8354 df-neg 8355 df-reap 8757 df-ap 8764 df-div 8855 df-inn 9146 df-2 9204 df-3 9205 df-4 9206 df-n0 9405 df-z 9482 df-uz 9758 df-q 9856 df-rp 9891 df-fz 10246 df-fzo 10380 df-fl 10533 df-mod 10588 df-seqfrec 10713 df-exp 10804 df-cj 11422 df-re 11423 df-im 11424 df-rsqrt 11578 df-abs 11579 df-dvds 12369 df-gcd 12545 df-prm 12700 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |