![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > dvdsprmpweq | Structured version Visualization version GIF version |
Description: If a positive integer divides a prime power, it is a prime power. (Contributed by AV, 25-Jul-2021.) |
Ref | Expression |
---|---|
dvdsprmpweq | ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ ∧ 𝑁 ∈ ℕ0) → (𝐴 ∥ (𝑃↑𝑁) → ∃𝑛 ∈ ℕ0 𝐴 = (𝑃↑𝑛))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simp1 1136 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ ∧ 𝑁 ∈ ℕ0) → 𝑃 ∈ ℙ) | |
2 | simp2 1137 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ ∧ 𝑁 ∈ ℕ0) → 𝐴 ∈ ℕ) | |
3 | 1, 2 | pccld 16897 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ ∧ 𝑁 ∈ ℕ0) → (𝑃 pCnt 𝐴) ∈ ℕ0) |
4 | 3 | adantr 480 | . . 3 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ ∧ 𝑁 ∈ ℕ0) ∧ 𝐴 ∥ (𝑃↑𝑁)) → (𝑃 pCnt 𝐴) ∈ ℕ0) |
5 | oveq2 7456 | . . . . 5 ⊢ (𝑛 = (𝑃 pCnt 𝐴) → (𝑃↑𝑛) = (𝑃↑(𝑃 pCnt 𝐴))) | |
6 | 5 | eqeq2d 2751 | . . . 4 ⊢ (𝑛 = (𝑃 pCnt 𝐴) → (𝐴 = (𝑃↑𝑛) ↔ 𝐴 = (𝑃↑(𝑃 pCnt 𝐴)))) |
7 | 6 | adantl 481 | . . 3 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ ∧ 𝑁 ∈ ℕ0) ∧ 𝐴 ∥ (𝑃↑𝑁)) ∧ 𝑛 = (𝑃 pCnt 𝐴)) → (𝐴 = (𝑃↑𝑛) ↔ 𝐴 = (𝑃↑(𝑃 pCnt 𝐴)))) |
8 | simpl3 1193 | . . . . 5 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ ∧ 𝑁 ∈ ℕ0) ∧ 𝐴 ∥ (𝑃↑𝑁)) → 𝑁 ∈ ℕ0) | |
9 | oveq2 7456 | . . . . . . 7 ⊢ (𝑛 = 𝑁 → (𝑃↑𝑛) = (𝑃↑𝑁)) | |
10 | 9 | breq2d 5178 | . . . . . 6 ⊢ (𝑛 = 𝑁 → (𝐴 ∥ (𝑃↑𝑛) ↔ 𝐴 ∥ (𝑃↑𝑁))) |
11 | 10 | adantl 481 | . . . . 5 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ ∧ 𝑁 ∈ ℕ0) ∧ 𝐴 ∥ (𝑃↑𝑁)) ∧ 𝑛 = 𝑁) → (𝐴 ∥ (𝑃↑𝑛) ↔ 𝐴 ∥ (𝑃↑𝑁))) |
12 | simpr 484 | . . . . 5 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ ∧ 𝑁 ∈ ℕ0) ∧ 𝐴 ∥ (𝑃↑𝑁)) → 𝐴 ∥ (𝑃↑𝑁)) | |
13 | 8, 11, 12 | rspcedvd 3637 | . . . 4 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ ∧ 𝑁 ∈ ℕ0) ∧ 𝐴 ∥ (𝑃↑𝑁)) → ∃𝑛 ∈ ℕ0 𝐴 ∥ (𝑃↑𝑛)) |
14 | pcprmpw2 16929 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) → (∃𝑛 ∈ ℕ0 𝐴 ∥ (𝑃↑𝑛) ↔ 𝐴 = (𝑃↑(𝑃 pCnt 𝐴)))) | |
15 | 14 | 3adant3 1132 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ ∧ 𝑁 ∈ ℕ0) → (∃𝑛 ∈ ℕ0 𝐴 ∥ (𝑃↑𝑛) ↔ 𝐴 = (𝑃↑(𝑃 pCnt 𝐴)))) |
16 | 15 | adantr 480 | . . . 4 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ ∧ 𝑁 ∈ ℕ0) ∧ 𝐴 ∥ (𝑃↑𝑁)) → (∃𝑛 ∈ ℕ0 𝐴 ∥ (𝑃↑𝑛) ↔ 𝐴 = (𝑃↑(𝑃 pCnt 𝐴)))) |
17 | 13, 16 | mpbid 232 | . . 3 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ ∧ 𝑁 ∈ ℕ0) ∧ 𝐴 ∥ (𝑃↑𝑁)) → 𝐴 = (𝑃↑(𝑃 pCnt 𝐴))) |
18 | 4, 7, 17 | rspcedvd 3637 | . 2 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ ∧ 𝑁 ∈ ℕ0) ∧ 𝐴 ∥ (𝑃↑𝑁)) → ∃𝑛 ∈ ℕ0 𝐴 = (𝑃↑𝑛)) |
19 | 18 | ex 412 | 1 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ ∧ 𝑁 ∈ ℕ0) → (𝐴 ∥ (𝑃↑𝑁) → ∃𝑛 ∈ ℕ0 𝐴 = (𝑃↑𝑛))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1537 ∈ wcel 2108 ∃wrex 3076 class class class wbr 5166 (class class class)co 7448 ℕcn 12293 ℕ0cn0 12553 ↑cexp 14112 ∥ cdvds 16302 ℙcprime 16718 pCnt cpc 16883 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-cnex 11240 ax-resscn 11241 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-mulcom 11248 ax-addass 11249 ax-mulass 11250 ax-distr 11251 ax-i2m1 11252 ax-1ne0 11253 ax-1rid 11254 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 ax-pre-lttri 11258 ax-pre-lttrn 11259 ax-pre-ltadd 11260 ax-pre-mulgt0 11261 ax-pre-sup 11262 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-rmo 3388 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-om 7904 df-1st 8030 df-2nd 8031 df-frecs 8322 df-wrecs 8353 df-recs 8427 df-rdg 8466 df-1o 8522 df-2o 8523 df-er 8763 df-en 9004 df-dom 9005 df-sdom 9006 df-fin 9007 df-sup 9511 df-inf 9512 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11522 df-neg 11523 df-div 11948 df-nn 12294 df-2 12356 df-3 12357 df-n0 12554 df-z 12640 df-uz 12904 df-q 13014 df-rp 13058 df-fz 13568 df-fl 13843 df-mod 13921 df-seq 14053 df-exp 14113 df-cj 15148 df-re 15149 df-im 15150 df-sqrt 15284 df-abs 15285 df-dvds 16303 df-gcd 16541 df-prm 16719 df-pc 16884 |
This theorem is referenced by: dvdsprmpweqnn 16932 dvdsprmpweqle 16933 |
Copyright terms: Public domain | W3C validator |