| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pcid | Structured version Visualization version GIF version | ||
| Description: The prime count of a prime power. (Contributed by Mario Carneiro, 9-Sep-2014.) |
| Ref | Expression |
|---|---|
| pcid | ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → (𝑃 pCnt (𝑃↑𝐴)) = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elznn0nn 12714 | . 2 ⊢ (𝐴 ∈ ℤ ↔ (𝐴 ∈ ℕ0 ∨ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ))) | |
| 2 | pcidlem 17059 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃 pCnt (𝑃↑𝐴)) = 𝐴) | |
| 3 | prmnn 16858 | . . . . . . . 8 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ) | |
| 4 | 3 | adantr 486 | . . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → 𝑃 ∈ ℕ) |
| 5 | 4 | nncnd 12358 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → 𝑃 ∈ ℂ) |
| 6 | simprl 783 | . . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → 𝐴 ∈ ℝ) | |
| 7 | 6 | recnd 11344 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → 𝐴 ∈ ℂ) |
| 8 | nnnn0 12620 | . . . . . . 7 ⊢ ( -𝐴 ∈ ℕ → -𝐴 ∈ ℕ0) | |
| 9 | 8 | ad2antll 742 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → -𝐴 ∈ ℕ0) |
| 10 | expneg2 14220 | . . . . . 6 ⊢ ((𝑃 ∈ ℂ ∧ 𝐴 ∈ ℂ ∧ -𝐴 ∈ ℕ0) → (𝑃↑𝐴) = (1 / (𝑃↑ -𝐴))) | |
| 11 | 5, 7, 9, 10 | syl3anc 1398 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → (𝑃↑𝐴) = (1 / (𝑃↑ -𝐴))) |
| 12 | 11 | oveq2d 7440 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → (𝑃 pCnt (𝑃↑𝐴)) = (𝑃 pCnt (1 / (𝑃↑ -𝐴)))) |
| 13 | simpl 488 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → 𝑃 ∈ ℙ) | |
| 14 | 1zzd 12734 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → 1 ∈ ℤ) | |
| 15 | ax-1ne0 11276 | . . . . . . 7 ⊢ 1 ≠ 0 | |
| 16 | 15 | a1i 11 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → 1 ≠ 0) |
| 17 | 4, 9 | nnexpcld 14396 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → (𝑃↑ -𝐴) ∈ ℕ) |
| 18 | pcdiv 17039 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (1 ∈ ℤ ∧ 1 ≠ 0) ∧ (𝑃↑ -𝐴) ∈ ℕ) → (𝑃 pCnt (1 / (𝑃↑ -𝐴))) = ((𝑃 pCnt 1) − (𝑃 pCnt (𝑃↑ -𝐴)))) | |
| 19 | 13, 14, 16, 17, 18 | syl121anc 1402 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → (𝑃 pCnt (1 / (𝑃↑ -𝐴))) = ((𝑃 pCnt 1) − (𝑃 pCnt (𝑃↑ -𝐴)))) |
| 20 | pc1 17042 | . . . . . . . 8 ⊢ (𝑃 ∈ ℙ → (𝑃 pCnt 1) = 0) | |
| 21 | 20 | adantr 486 | . . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → (𝑃 pCnt 1) = 0) |
| 22 | pcidlem 17059 | . . . . . . . 8 ⊢ ((𝑃 ∈ ℙ ∧ -𝐴 ∈ ℕ0) → (𝑃 pCnt (𝑃↑ -𝐴)) = -𝐴) | |
| 23 | 9, 22 | syldan 603 | . . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → (𝑃 pCnt (𝑃↑ -𝐴)) = -𝐴) |
| 24 | 21, 23 | oveq12d 7442 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → ((𝑃 pCnt 1) − (𝑃 pCnt (𝑃↑ -𝐴))) = (0 − -𝐴)) |
| 25 | df-neg 11551 | . . . . . . 7 ⊢ - -𝐴 = (0 − -𝐴) | |
| 26 | 7 | negnegd 11667 | . . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → - -𝐴 = 𝐴) |
| 27 | 25, 26 | eqtr3id 2809 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → (0 − -𝐴) = 𝐴) |
| 28 | 24, 27 | eqtrd 2795 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → ((𝑃 pCnt 1) − (𝑃 pCnt (𝑃↑ -𝐴))) = 𝐴) |
| 29 | 19, 28 | eqtrd 2795 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → (𝑃 pCnt (1 / (𝑃↑ -𝐴))) = 𝐴) |
| 30 | 12, 29 | eqtrd 2795 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → (𝑃 pCnt (𝑃↑𝐴)) = 𝐴) |
| 31 | 2, 30 | jaodan 972 | . 2 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℕ0 ∨ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ))) → (𝑃 pCnt (𝑃↑𝐴)) = 𝐴) |
| 32 | 1, 31 | sylan2b 606 | 1 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → (𝑃 pCnt (𝑃↑𝐴)) = 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∨ wo 861 = wceq 1569 ∈ wcel 2144 ≠ wne 2955 (class class class)co 7424 ℂcc 11205 ℝcr 11206 0cc0 11207 1c1 11208 − cmin 11548 -cneg 11549 / cdiv 11980 ℕcn 12342 ℕ0cn0 12613 ℤcz 12700 ↑cexp 14211 ℙcprime 16855 pCnt cpc 17023 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5327 ax-pr 5391 ax-un 7755 ax-cnex 11263 ax-resscn 11264 ax-1cn 11265 ax-icn 11266 ax-addcl 11267 ax-addrcl 11268 ax-mulcl 11269 ax-mulrcl 11270 ax-mulcom 11271 ax-addass 11272 ax-mulass 11273 ax-distr 11274 ax-i2m1 11275 ax-1ne0 11276 ax-1rid 11277 ax-rnegex 11278 ax-rrecex 11279 ax-cnre 11280 ax-pre-lttri 11281 ax-pre-lttrn 11282 ax-pre-ltadd 11283 ax-pre-mulgt0 11284 ax-pre-sup 11285 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6307 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7381 df-ov 7427 df-oprab 7428 df-mpo 7429 df-om 7882 df-1st 8005 df-2nd 8006 df-frecs 8307 df-wrecs 8338 df-recs 8387 df-rdg 8426 df-1o 8484 df-2o 8485 df-er 8725 df-en 8982 df-dom 8983 df-sdom 8984 df-fin 8985 df-sup 9441 df-inf 9442 df-pnf 11352 df-mnf 11353 df-xr 11354 df-ltxr 11355 df-le 11356 df-sub 11550 df-neg 11551 df-div 11981 df-nn 12343 df-2 12412 df-3 12413 df-n0 12614 df-z 12701 df-uz 12973 df-q 13083 df-rp 13128 df-fl 13939 df-mod 14017 df-seq 14152 df-exp 14212 df-cj 15275 df-re 15276 df-im 15277 df-sqrt 15411 df-abs 15412 df-dvds 16432 df-gcd 16674 df-prm 16856 df-pc 17024 |
| This theorem is used by: pcprmpw2 17069 pcaddlem 17075 expnprm 17089 sylow1lem1 19821 pgpfi 19828 ablfaclem3 20312 isppw2 27451 dvdsppwf1o 27522 lgsval2lem 27643 dchrisum0flblem1 27844 ostth3 27974 aks4d1p8d2 43272 |
| Copyright terms: Public domain | W3C validator |