| 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 9359 | . 2 ⊢ (𝐴 ∈ ℤ ↔ (𝐴 ∈ ℕ0 ∨ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ))) | |
| 2 | pcidlem 12519 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑃 pCnt (𝑃↑𝐴)) = 𝐴) | |
| 3 | prmnn 12305 | . . . . . . . 8 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ) | |
| 4 | 3 | adantr 276 | . . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → 𝑃 ∈ ℕ) |
| 5 | 4 | nncnd 9023 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → 𝑃 ∈ ℂ) |
| 6 | 4 | nnap0d 9055 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → 𝑃 # 0) |
| 7 | simprl 529 | . . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → 𝐴 ∈ ℝ) | |
| 8 | 7 | recnd 8074 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → 𝐴 ∈ ℂ) |
| 9 | nnnn0 9275 | . . . . . . 7 ⊢ (-𝐴 ∈ ℕ → -𝐴 ∈ ℕ0) | |
| 10 | 9 | ad2antll 491 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → -𝐴 ∈ ℕ0) |
| 11 | expineg2 10659 | . . . . . 6 ⊢ (((𝑃 ∈ ℂ ∧ 𝑃 # 0) ∧ (𝐴 ∈ ℂ ∧ -𝐴 ∈ ℕ0)) → (𝑃↑𝐴) = (1 / (𝑃↑-𝐴))) | |
| 12 | 5, 6, 8, 10, 11 | syl22anc 1250 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → (𝑃↑𝐴) = (1 / (𝑃↑-𝐴))) |
| 13 | 12 | oveq2d 5941 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → (𝑃 pCnt (𝑃↑𝐴)) = (𝑃 pCnt (1 / (𝑃↑-𝐴)))) |
| 14 | simpl 109 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → 𝑃 ∈ ℙ) | |
| 15 | 1zzd 9372 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → 1 ∈ ℤ) | |
| 16 | 1ne0 9077 | . . . . . . 7 ⊢ 1 ≠ 0 | |
| 17 | 16 | a1i 9 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → 1 ≠ 0) |
| 18 | 4, 10 | nnexpcld 10806 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → (𝑃↑-𝐴) ∈ ℕ) |
| 19 | pcdiv 12498 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (1 ∈ ℤ ∧ 1 ≠ 0) ∧ (𝑃↑-𝐴) ∈ ℕ) → (𝑃 pCnt (1 / (𝑃↑-𝐴))) = ((𝑃 pCnt 1) − (𝑃 pCnt (𝑃↑-𝐴)))) | |
| 20 | 14, 15, 17, 18, 19 | syl121anc 1254 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → (𝑃 pCnt (1 / (𝑃↑-𝐴))) = ((𝑃 pCnt 1) − (𝑃 pCnt (𝑃↑-𝐴)))) |
| 21 | pc1 12501 | . . . . . . . 8 ⊢ (𝑃 ∈ ℙ → (𝑃 pCnt 1) = 0) | |
| 22 | 21 | adantr 276 | . . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → (𝑃 pCnt 1) = 0) |
| 23 | pcidlem 12519 | . . . . . . . 8 ⊢ ((𝑃 ∈ ℙ ∧ -𝐴 ∈ ℕ0) → (𝑃 pCnt (𝑃↑-𝐴)) = -𝐴) | |
| 24 | 10, 23 | syldan 282 | . . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → (𝑃 pCnt (𝑃↑-𝐴)) = -𝐴) |
| 25 | 22, 24 | oveq12d 5943 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → ((𝑃 pCnt 1) − (𝑃 pCnt (𝑃↑-𝐴))) = (0 − -𝐴)) |
| 26 | df-neg 8219 | . . . . . . 7 ⊢ --𝐴 = (0 − -𝐴) | |
| 27 | 8 | negnegd 8347 | . . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → --𝐴 = 𝐴) |
| 28 | 26, 27 | eqtr3id 2243 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → (0 − -𝐴) = 𝐴) |
| 29 | 25, 28 | eqtrd 2229 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → ((𝑃 pCnt 1) − (𝑃 pCnt (𝑃↑-𝐴))) = 𝐴) |
| 30 | 20, 29 | eqtrd 2229 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → (𝑃 pCnt (1 / (𝑃↑-𝐴))) = 𝐴) |
| 31 | 13, 30 | eqtrd 2229 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ)) → (𝑃 pCnt (𝑃↑𝐴)) = 𝐴) |
| 32 | 2, 31 | jaodan 798 | . 2 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℕ0 ∨ (𝐴 ∈ ℝ ∧ -𝐴 ∈ ℕ))) → (𝑃 pCnt (𝑃↑𝐴)) = 𝐴) |
| 33 | 1, 32 | sylan2b 287 | 1 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → (𝑃 pCnt (𝑃↑𝐴)) = 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∨ wo 709 = wceq 1364 ∈ wcel 2167 ≠ wne 2367 class class class wbr 4034 (class class class)co 5925 ℂcc 7896 ℝcr 7897 0cc0 7898 1c1 7899 − cmin 8216 -cneg 8217 # cap 8627 / cdiv 8718 ℕcn 9009 ℕ0cn0 9268 ℤcz 9345 ↑cexp 10649 ℙcprime 12302 pCnt cpc 12480 |
| 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 615 ax-in2 616 ax-io 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-13 2169 ax-14 2170 ax-ext 2178 ax-coll 4149 ax-sep 4152 ax-nul 4160 ax-pow 4208 ax-pr 4243 ax-un 4469 ax-setind 4574 ax-iinf 4625 ax-cnex 7989 ax-resscn 7990 ax-1cn 7991 ax-1re 7992 ax-icn 7993 ax-addcl 7994 ax-addrcl 7995 ax-mulcl 7996 ax-mulrcl 7997 ax-addcom 7998 ax-mulcom 7999 ax-addass 8000 ax-mulass 8001 ax-distr 8002 ax-i2m1 8003 ax-0lt1 8004 ax-1rid 8005 ax-0id 8006 ax-rnegex 8007 ax-precex 8008 ax-cnre 8009 ax-pre-ltirr 8010 ax-pre-ltwlin 8011 ax-pre-lttrn 8012 ax-pre-apti 8013 ax-pre-ltadd 8014 ax-pre-mulgt0 8015 ax-pre-mulext 8016 ax-arch 8017 ax-caucvg 8018 |
| This theorem depends on definitions: df-bi 117 df-stab 832 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ne 2368 df-nel 2463 df-ral 2480 df-rex 2481 df-reu 2482 df-rmo 2483 df-rab 2484 df-v 2765 df-sbc 2990 df-csb 3085 df-dif 3159 df-un 3161 df-in 3163 df-ss 3170 df-nul 3452 df-if 3563 df-pw 3608 df-sn 3629 df-pr 3630 df-op 3632 df-uni 3841 df-int 3876 df-iun 3919 df-br 4035 df-opab 4096 df-mpt 4097 df-tr 4133 df-id 4329 df-po 4332 df-iso 4333 df-iord 4402 df-on 4404 df-ilim 4405 df-suc 4407 df-iom 4628 df-xp 4670 df-rel 4671 df-cnv 4672 df-co 4673 df-dm 4674 df-rn 4675 df-res 4676 df-ima 4677 df-iota 5220 df-fun 5261 df-fn 5262 df-f 5263 df-f1 5264 df-fo 5265 df-f1o 5266 df-fv 5267 df-isom 5268 df-riota 5880 df-ov 5928 df-oprab 5929 df-mpo 5930 df-1st 6207 df-2nd 6208 df-recs 6372 df-frec 6458 df-1o 6483 df-2o 6484 df-er 6601 df-en 6809 df-sup 7059 df-inf 7060 df-pnf 8082 df-mnf 8083 df-xr 8084 df-ltxr 8085 df-le 8086 df-sub 8218 df-neg 8219 df-reap 8621 df-ap 8628 df-div 8719 df-inn 9010 df-2 9068 df-3 9069 df-4 9070 df-n0 9269 df-z 9346 df-uz 9621 df-q 9713 df-rp 9748 df-fz 10103 df-fzo 10237 df-fl 10379 df-mod 10434 df-seqfrec 10559 df-exp 10650 df-cj 11026 df-re 11027 df-im 11028 df-rsqrt 11182 df-abs 11183 df-dvds 11972 df-gcd 12148 df-prm 12303 df-pc 12481 |
| This theorem is referenced by: pcprmpw2 12529 pcaddlem 12535 expnprm 12549 dvdsppwf1o 15333 lgsval2lem 15359 |
| Copyright terms: Public domain | W3C validator |