| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > pcid | 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 9537 | . 2 ⊢ (𝐴 ∈ ℤ ↔ (𝐴 ∈ ℕ0 ∨ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ))) | |
| 2 | pcidlem 12959 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃 pCnt (𝑃↑𝐴)) = 𝐴) | |
| 3 | prmnn 12745 | . . . . . . . 8 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ) | |
| 4 | 3 | adantr 276 | . . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → 𝑃 ∈ ℕ) |
| 5 | 4 | nncnd 9199 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → 𝑃 ∈ ℂ) |
| 6 | 4 | nnap0d 9231 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → 𝑃 # 0) |
| 7 | simprl 531 | . . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → 𝐴 ∈ ℝ) | |
| 8 | 7 | recnd 8250 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → 𝐴 ∈ ℂ) |
| 9 | nnnn0 9451 | . . . . . . 7 ⊢ (-𝐴 ∈ ℕ → -𝐴 ∈ ℕ0) | |
| 10 | 9 | ad2antll 491 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → -𝐴 ∈ ℕ0) |
| 11 | expineg2 10856 | . . . . . 6 ⊢ (((𝑃 ∈ ℂ ∧ 𝑃 # 0) ∧ (𝐴 ∈ ℂ ∧ -𝐴 ∈ ℕ0)) → (𝑃↑𝐴) = (1 / (𝑃↑-𝐴))) | |
| 12 | 5, 6, 8, 10, 11 | syl22anc 1275 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → (𝑃↑𝐴) = (1 / (𝑃↑-𝐴))) |
| 13 | 12 | oveq2d 6044 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → (𝑃 pCnt (𝑃↑𝐴)) = (𝑃 pCnt (1 / (𝑃↑-𝐴)))) |
| 14 | simpl 109 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → 𝑃 ∈ ℙ) | |
| 15 | 1zzd 9550 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → 1 ∈ ℤ) | |
| 16 | 1ne0 9253 | . . . . . . 7 ⊢ 1 ≠ 0 | |
| 17 | 16 | a1i 9 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → 1 ≠ 0) |
| 18 | 4, 10 | nnexpcld 11003 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → (𝑃↑-𝐴) ∈ ℕ) |
| 19 | pcdiv 12938 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (1 ∈ ℤ ∧ 1 ≠ 0) ∧ (𝑃↑-𝐴) ∈ ℕ) → (𝑃 pCnt (1 / (𝑃↑-𝐴))) = ((𝑃 pCnt 1) − (𝑃 pCnt (𝑃↑-𝐴)))) | |
| 20 | 14, 15, 17, 18, 19 | syl121anc 1279 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → (𝑃 pCnt (1 / (𝑃↑-𝐴))) = ((𝑃 pCnt 1) − (𝑃 pCnt (𝑃↑-𝐴)))) |
| 21 | pc1 12941 | . . . . . . . 8 ⊢ (𝑃 ∈ ℙ → (𝑃 pCnt 1) = 0) | |
| 22 | 21 | adantr 276 | . . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → (𝑃 pCnt 1) = 0) |
| 23 | pcidlem 12959 | . . . . . . . 8 ⊢ ((𝑃 ∈ ℙ ∧ -𝐴 ∈ ℕ0) → (𝑃 pCnt (𝑃↑-𝐴)) = -𝐴) | |
| 24 | 10, 23 | syldan 282 | . . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → (𝑃 pCnt (𝑃↑-𝐴)) = -𝐴) |
| 25 | 22, 24 | oveq12d 6046 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → ((𝑃 pCnt 1) − (𝑃 pCnt (𝑃↑-𝐴))) = (0 − -𝐴)) |
| 26 | df-neg 8395 | . . . . . . 7 ⊢ --𝐴 = (0 − -𝐴) | |
| 27 | 8 | negnegd 8523 | . . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → --𝐴 = 𝐴) |
| 28 | 26, 27 | eqtr3id 2278 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → (0 − -𝐴) = 𝐴) |
| 29 | 25, 28 | eqtrd 2264 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → ((𝑃 pCnt 1) − (𝑃 pCnt (𝑃↑-𝐴))) = 𝐴) |
| 30 | 20, 29 | eqtrd 2264 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → (𝑃 pCnt (1 / (𝑃↑-𝐴))) = 𝐴) |
| 31 | 13, 30 | eqtrd 2264 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → (𝑃 pCnt (𝑃↑𝐴)) = 𝐴) |
| 32 | 2, 31 | jaodan 805 | . 2 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℕ0 ∨ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ))) → (𝑃 pCnt (𝑃↑𝐴)) = 𝐴) |
| 33 | 1, 32 | sylan2b 287 | 1 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → (𝑃 pCnt (𝑃↑𝐴)) = 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∨ wo 716 = wceq 1398 ∈ wcel 2202 ≠ wne 2403 class class class wbr 4093 (class class class)co 6028 ℂcc 8073 ℝcr 8074 0cc0 8075 1c1 8076 − cmin 8392 -cneg 8393 # cap 8803 / cdiv 8894 ℕcn 9185 ℕ0cn0 9444 ℤcz 9523 ↑cexp 10846 ℙcprime 12742 pCnt cpc 12920 |
| 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 2204 ax-14 2205 ax-ext 2213 ax-coll 4209 ax-sep 4212 ax-nul 4220 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-iinf 4692 ax-cnex 8166 ax-resscn 8167 ax-1cn 8168 ax-1re 8169 ax-icn 8170 ax-addcl 8171 ax-addrcl 8172 ax-mulcl 8173 ax-mulrcl 8174 ax-addcom 8175 ax-mulcom 8176 ax-addass 8177 ax-mulass 8178 ax-distr 8179 ax-i2m1 8180 ax-0lt1 8181 ax-1rid 8182 ax-0id 8183 ax-rnegex 8184 ax-precex 8185 ax-cnre 8186 ax-pre-ltirr 8187 ax-pre-ltwlin 8188 ax-pre-lttrn 8189 ax-pre-apti 8190 ax-pre-ltadd 8191 ax-pre-mulgt0 8192 ax-pre-mulext 8193 ax-arch 8194 ax-caucvg 8195 |
| This theorem depends on definitions: df-bi 117 df-stab 839 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-ral 2516 df-rex 2517 df-reu 2518 df-rmo 2519 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-if 3608 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-tr 4193 df-id 4396 df-po 4399 df-iso 4400 df-iord 4469 df-on 4471 df-ilim 4472 df-suc 4474 df-iom 4695 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-isom 5342 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-1st 6312 df-2nd 6313 df-recs 6514 df-frec 6600 df-1o 6625 df-2o 6626 df-er 6745 df-en 6953 df-sup 7226 df-inf 7227 df-pnf 8258 df-mnf 8259 df-xr 8260 df-ltxr 8261 df-le 8262 df-sub 8394 df-neg 8395 df-reap 8797 df-ap 8804 df-div 8895 df-inn 9186 df-2 9244 df-3 9245 df-4 9246 df-n0 9445 df-z 9524 df-uz 9800 df-q 9898 df-rp 9933 df-fz 10289 df-fzo 10423 df-fl 10576 df-mod 10631 df-seqfrec 10756 df-exp 10847 df-cj 11465 df-re 11466 df-im 11467 df-rsqrt 11621 df-abs 11622 df-dvds 12412 df-gcd 12588 df-prm 12743 df-pc 12921 |
| This theorem is referenced by: pcprmpw2 12969 pcaddlem 12975 expnprm 12989 dvdsppwf1o 15786 lgsval2lem 15812 |
| Copyright terms: Public domain | W3C validator |