| 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 1152 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ ∧ 𝑁 ∈ ℕ0) → 𝑃 ∈ ℙ) | |
| 2 | simp2 1153 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ ∧ 𝑁 ∈ ℕ0) → 𝐴 ∈ ℕ) | |
| 3 | 1, 2 | pccld 16909 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ ∧ 𝑁 ∈ ℕ0) → (𝑃 pCnt 𝐴) ∈ ℕ0) |
| 4 | 3 | adantr 485 | . . 3 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ ∧ 𝑁 ∈ ℕ0) ∧ 𝐴 ∥ (𝑃↑𝑁)) → (𝑃 pCnt 𝐴) ∈ ℕ0) |
| 5 | oveq2 7419 | . . . . 5 ⊢ (𝑛 = (𝑃 pCnt 𝐴) → (𝑃↑𝑛) = (𝑃↑(𝑃 pCnt 𝐴))) | |
| 6 | 5 | eqeq2d 2780 | . . . 4 ⊢ (𝑛 = (𝑃 pCnt 𝐴) → (𝐴 = (𝑃↑𝑛) ↔ 𝐴 = (𝑃↑(𝑃 pCnt 𝐴)))) |
| 7 | 6 | adantl 486 | . . 3 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ ∧ 𝑁 ∈ ℕ0) ∧ 𝐴 ∥ (𝑃↑𝑁)) ∧ 𝑛 = (𝑃 pCnt 𝐴)) → (𝐴 = (𝑃↑𝑛) ↔ 𝐴 = (𝑃↑(𝑃 pCnt 𝐴)))) |
| 8 | simpl3 1210 | . . . . 5 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ ∧ 𝑁 ∈ ℕ0) ∧ 𝐴 ∥ (𝑃↑𝑁)) → 𝑁 ∈ ℕ0) | |
| 9 | oveq2 7419 | . . . . . . 7 ⊢ (𝑛 = 𝑁 → (𝑃↑𝑛) = (𝑃↑𝑁)) | |
| 10 | 9 | breq2d 5125 | . . . . . 6 ⊢ (𝑛 = 𝑁 → (𝐴 ∥ (𝑃↑𝑛) ↔ 𝐴 ∥ (𝑃↑𝑁))) |
| 11 | 10 | adantl 486 | . . . . 5 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ ∧ 𝑁 ∈ ℕ0) ∧ 𝐴 ∥ (𝑃↑𝑁)) ∧ 𝑛 = 𝑁) → (𝐴 ∥ (𝑃↑𝑛) ↔ 𝐴 ∥ (𝑃↑𝑁))) |
| 12 | simpr 489 | . . . . 5 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ ∧ 𝑁 ∈ ℕ0) ∧ 𝐴 ∥ (𝑃↑𝑁)) → 𝐴 ∥ (𝑃↑𝑁)) | |
| 13 | 8, 11, 12 | rspcedvd 3592 | . . . 4 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ ∧ 𝑁 ∈ ℕ0) ∧ 𝐴 ∥ (𝑃↑𝑁)) → ∃𝑛 ∈ ℕ0 𝐴 ∥ (𝑃↑𝑛)) |
| 14 | pcprmpw2 16941 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) → (∃𝑛 ∈ ℕ0 𝐴 ∥ (𝑃↑𝑛) ↔ 𝐴 = (𝑃↑(𝑃 pCnt 𝐴)))) | |
| 15 | 14 | 3adant3 1148 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ ∧ 𝑁 ∈ ℕ0) → (∃𝑛 ∈ ℕ0 𝐴 ∥ (𝑃↑𝑛) ↔ 𝐴 = (𝑃↑(𝑃 pCnt 𝐴)))) |
| 16 | 15 | adantr 485 | . . . 4 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ ∧ 𝑁 ∈ ℕ0) ∧ 𝐴 ∥ (𝑃↑𝑁)) → (∃𝑛 ∈ ℕ0 𝐴 ∥ (𝑃↑𝑛) ↔ 𝐴 = (𝑃↑(𝑃 pCnt 𝐴)))) |
| 17 | 13, 16 | mpbid 235 | . . 3 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ ∧ 𝑁 ∈ ℕ0) ∧ 𝐴 ∥ (𝑃↑𝑁)) → 𝐴 = (𝑃↑(𝑃 pCnt 𝐴))) |
| 18 | 4, 7, 17 | rspcedvd 3592 | . 2 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ ∧ 𝑁 ∈ ℕ0) ∧ 𝐴 ∥ (𝑃↑𝑁)) → ∃𝑛 ∈ ℕ0 𝐴 = (𝑃↑𝑛)) |
| 19 | 18 | ex 417 | 1 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ ∧ 𝑁 ∈ ℕ0) → (𝐴 ∥ (𝑃↑𝑁) → ∃𝑛 ∈ ℕ0 𝐴 = (𝑃↑𝑛))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 ∃wrex 3095 class class class wbr 5113 (class class class)co 7411 ℕcn 12232 ℕ0cn0 12503 ↑cexp 14096 ∥ cdvds 16309 ℙcprime 16728 pCnt cpc 16895 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11155 ax-resscn 11156 ax-1cn 11157 ax-icn 11158 ax-addcl 11159 ax-addrcl 11160 ax-mulcl 11161 ax-mulrcl 11162 ax-mulcom 11163 ax-addass 11164 ax-mulass 11165 ax-distr 11166 ax-i2m1 11167 ax-1ne0 11168 ax-1rid 11169 ax-rnegex 11170 ax-rrecex 11171 ax-cnre 11172 ax-pre-lttri 11173 ax-pre-lttrn 11174 ax-pre-ltadd 11175 ax-pre-mulgt0 11176 ax-pre-sup 11177 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7862 df-1st 7985 df-2nd 7986 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-1o 8452 df-2o 8453 df-er 8693 df-en 8943 df-dom 8944 df-sdom 8945 df-fin 8946 df-sup 9401 df-inf 9402 df-pnf 11244 df-mnf 11245 df-xr 11246 df-ltxr 11247 df-le 11248 df-sub 11442 df-neg 11443 df-div 11871 df-nn 12233 df-2 12302 df-3 12303 df-n0 12504 df-z 12591 df-uz 12862 df-q 12972 df-rp 13016 df-fz 13535 df-fl 13824 df-mod 13902 df-seq 14037 df-exp 14097 df-cj 15149 df-re 15150 df-im 15151 df-sqrt 15285 df-abs 15286 df-dvds 16310 df-gcd 16552 df-prm 16729 df-pc 16896 |
| This theorem is referenced by: dvdsprmpweqnn 16944 dvdsprmpweqle 16945 constrext2chnlem 34084 |
| Copyright terms: Public domain | W3C validator |