| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pcbcctr | Structured version Visualization version GIF version | ||
| Description: Prime count of a central binomial coefficient. (Contributed by Mario Carneiro, 12-Mar-2014.) |
| Ref | Expression |
|---|---|
| pcbcctr | ⊢ ((𝑁 ∈ ℕ ∧ 𝑃 ∈ ℙ) → (𝑃 pCnt ((2 · 𝑁)C𝑁)) = Σ𝑘 ∈ (1...(2 · 𝑁))((⌊‘((2 · 𝑁) / (𝑃↑𝑘))) − (2 · (⌊‘(𝑁 / (𝑃↑𝑘)))))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2nn 12266 | . . . . 5 ⊢ 2 ∈ ℕ | |
| 2 | nnmulcl 12217 | . . . . 5 ⊢ ((2 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (2 · 𝑁) ∈ ℕ) | |
| 3 | 1, 2 | mpan 690 | . . . 4 ⊢ (𝑁 ∈ ℕ → (2 · 𝑁) ∈ ℕ) |
| 4 | 3 | adantr 480 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝑃 ∈ ℙ) → (2 · 𝑁) ∈ ℕ) |
| 5 | nnnn0 12456 | . . . . 5 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℕ0) | |
| 6 | fzctr 13608 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ (0...(2 · 𝑁))) | |
| 7 | 5, 6 | syl 17 | . . . 4 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ (0...(2 · 𝑁))) |
| 8 | 7 | adantr 480 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝑃 ∈ ℙ) → 𝑁 ∈ (0...(2 · 𝑁))) |
| 9 | simpr 484 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝑃 ∈ ℙ) → 𝑃 ∈ ℙ) | |
| 10 | pcbc 16878 | . . 3 ⊢ (((2 · 𝑁) ∈ ℕ ∧ 𝑁 ∈ (0...(2 · 𝑁)) ∧ 𝑃 ∈ ℙ) → (𝑃 pCnt ((2 · 𝑁)C𝑁)) = Σ𝑘 ∈ (1...(2 · 𝑁))((⌊‘((2 · 𝑁) / (𝑃↑𝑘))) − ((⌊‘(((2 · 𝑁) − 𝑁) / (𝑃↑𝑘))) + (⌊‘(𝑁 / (𝑃↑𝑘)))))) | |
| 11 | 4, 8, 9, 10 | syl3anc 1373 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝑃 ∈ ℙ) → (𝑃 pCnt ((2 · 𝑁)C𝑁)) = Σ𝑘 ∈ (1...(2 · 𝑁))((⌊‘((2 · 𝑁) / (𝑃↑𝑘))) − ((⌊‘(((2 · 𝑁) − 𝑁) / (𝑃↑𝑘))) + (⌊‘(𝑁 / (𝑃↑𝑘)))))) |
| 12 | nncn 12201 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℂ) | |
| 13 | 12 | 2timesd 12432 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℕ → (2 · 𝑁) = (𝑁 + 𝑁)) |
| 14 | 12, 12, 13 | mvrladdd 11598 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ → ((2 · 𝑁) − 𝑁) = 𝑁) |
| 15 | 14 | fvoveq1d 7412 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ → (⌊‘(((2 · 𝑁) − 𝑁) / (𝑃↑𝑘))) = (⌊‘(𝑁 / (𝑃↑𝑘)))) |
| 16 | 15 | oveq1d 7405 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → ((⌊‘(((2 · 𝑁) − 𝑁) / (𝑃↑𝑘))) + (⌊‘(𝑁 / (𝑃↑𝑘)))) = ((⌊‘(𝑁 / (𝑃↑𝑘))) + (⌊‘(𝑁 / (𝑃↑𝑘))))) |
| 17 | 16 | ad2antrr 726 | . . . . 5 ⊢ (((𝑁 ∈ ℕ ∧ 𝑃 ∈ ℙ) ∧ 𝑘 ∈ (1...(2 · 𝑁))) → ((⌊‘(((2 · 𝑁) − 𝑁) / (𝑃↑𝑘))) + (⌊‘(𝑁 / (𝑃↑𝑘)))) = ((⌊‘(𝑁 / (𝑃↑𝑘))) + (⌊‘(𝑁 / (𝑃↑𝑘))))) |
| 18 | nnre 12200 | . . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℝ) | |
| 19 | 18 | ad2antrr 726 | . . . . . . . . 9 ⊢ (((𝑁 ∈ ℕ ∧ 𝑃 ∈ ℙ) ∧ 𝑘 ∈ (1...(2 · 𝑁))) → 𝑁 ∈ ℝ) |
| 20 | prmnn 16651 | . . . . . . . . . . 11 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ) | |
| 21 | 20 | adantl 481 | . . . . . . . . . 10 ⊢ ((𝑁 ∈ ℕ ∧ 𝑃 ∈ ℙ) → 𝑃 ∈ ℕ) |
| 22 | elfznn 13521 | . . . . . . . . . . 11 ⊢ (𝑘 ∈ (1...(2 · 𝑁)) → 𝑘 ∈ ℕ) | |
| 23 | 22 | nnnn0d 12510 | . . . . . . . . . 10 ⊢ (𝑘 ∈ (1...(2 · 𝑁)) → 𝑘 ∈ ℕ0) |
| 24 | nnexpcl 14046 | . . . . . . . . . 10 ⊢ ((𝑃 ∈ ℕ ∧ 𝑘 ∈ ℕ0) → (𝑃↑𝑘) ∈ ℕ) | |
| 25 | 21, 23, 24 | syl2an 596 | . . . . . . . . 9 ⊢ (((𝑁 ∈ ℕ ∧ 𝑃 ∈ ℙ) ∧ 𝑘 ∈ (1...(2 · 𝑁))) → (𝑃↑𝑘) ∈ ℕ) |
| 26 | 19, 25 | nndivred 12247 | . . . . . . . 8 ⊢ (((𝑁 ∈ ℕ ∧ 𝑃 ∈ ℙ) ∧ 𝑘 ∈ (1...(2 · 𝑁))) → (𝑁 / (𝑃↑𝑘)) ∈ ℝ) |
| 27 | 26 | flcld 13767 | . . . . . . 7 ⊢ (((𝑁 ∈ ℕ ∧ 𝑃 ∈ ℙ) ∧ 𝑘 ∈ (1...(2 · 𝑁))) → (⌊‘(𝑁 / (𝑃↑𝑘))) ∈ ℤ) |
| 28 | 27 | zcnd 12646 | . . . . . 6 ⊢ (((𝑁 ∈ ℕ ∧ 𝑃 ∈ ℙ) ∧ 𝑘 ∈ (1...(2 · 𝑁))) → (⌊‘(𝑁 / (𝑃↑𝑘))) ∈ ℂ) |
| 29 | 28 | 2timesd 12432 | . . . . 5 ⊢ (((𝑁 ∈ ℕ ∧ 𝑃 ∈ ℙ) ∧ 𝑘 ∈ (1...(2 · 𝑁))) → (2 · (⌊‘(𝑁 / (𝑃↑𝑘)))) = ((⌊‘(𝑁 / (𝑃↑𝑘))) + (⌊‘(𝑁 / (𝑃↑𝑘))))) |
| 30 | 17, 29 | eqtr4d 2768 | . . . 4 ⊢ (((𝑁 ∈ ℕ ∧ 𝑃 ∈ ℙ) ∧ 𝑘 ∈ (1...(2 · 𝑁))) → ((⌊‘(((2 · 𝑁) − 𝑁) / (𝑃↑𝑘))) + (⌊‘(𝑁 / (𝑃↑𝑘)))) = (2 · (⌊‘(𝑁 / (𝑃↑𝑘))))) |
| 31 | 30 | oveq2d 7406 | . . 3 ⊢ (((𝑁 ∈ ℕ ∧ 𝑃 ∈ ℙ) ∧ 𝑘 ∈ (1...(2 · 𝑁))) → ((⌊‘((2 · 𝑁) / (𝑃↑𝑘))) − ((⌊‘(((2 · 𝑁) − 𝑁) / (𝑃↑𝑘))) + (⌊‘(𝑁 / (𝑃↑𝑘))))) = ((⌊‘((2 · 𝑁) / (𝑃↑𝑘))) − (2 · (⌊‘(𝑁 / (𝑃↑𝑘)))))) |
| 32 | 31 | sumeq2dv 15675 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝑃 ∈ ℙ) → Σ𝑘 ∈ (1...(2 · 𝑁))((⌊‘((2 · 𝑁) / (𝑃↑𝑘))) − ((⌊‘(((2 · 𝑁) − 𝑁) / (𝑃↑𝑘))) + (⌊‘(𝑁 / (𝑃↑𝑘))))) = Σ𝑘 ∈ (1...(2 · 𝑁))((⌊‘((2 · 𝑁) / (𝑃↑𝑘))) − (2 · (⌊‘(𝑁 / (𝑃↑𝑘)))))) |
| 33 | 11, 32 | eqtrd 2765 | 1 ⊢ ((𝑁 ∈ ℕ ∧ 𝑃 ∈ ℙ) → (𝑃 pCnt ((2 · 𝑁)C𝑁)) = Σ𝑘 ∈ (1...(2 · 𝑁))((⌊‘((2 · 𝑁) / (𝑃↑𝑘))) − (2 · (⌊‘(𝑁 / (𝑃↑𝑘)))))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ‘cfv 6514 (class class class)co 7390 ℝcr 11074 0cc0 11075 1c1 11076 + caddc 11078 · cmul 11080 − cmin 11412 / cdiv 11842 ℕcn 12193 2c2 12248 ℕ0cn0 12449 ...cfz 13475 ⌊cfl 13759 ↑cexp 14033 Ccbc 14274 Σcsu 15659 ℙcprime 16648 pCnt cpc 16814 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-rep 5237 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 ax-inf2 9601 ax-cnex 11131 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 ax-pre-mulgt0 11152 ax-pre-sup 11153 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-rmo 3356 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-pss 3937 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-int 4914 df-iun 4960 df-br 5111 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5536 df-eprel 5541 df-po 5549 df-so 5550 df-fr 5594 df-se 5595 df-we 5596 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-pred 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-isom 6523 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-om 7846 df-1st 7971 df-2nd 7972 df-frecs 8263 df-wrecs 8294 df-recs 8343 df-rdg 8381 df-1o 8437 df-2o 8438 df-er 8674 df-en 8922 df-dom 8923 df-sdom 8924 df-fin 8925 df-sup 9400 df-inf 9401 df-oi 9470 df-card 9899 df-pnf 11217 df-mnf 11218 df-xr 11219 df-ltxr 11220 df-le 11221 df-sub 11414 df-neg 11415 df-div 11843 df-nn 12194 df-2 12256 df-3 12257 df-n0 12450 df-z 12537 df-uz 12801 df-q 12915 df-rp 12959 df-fz 13476 df-fzo 13623 df-fl 13761 df-mod 13839 df-seq 13974 df-exp 14034 df-fac 14246 df-bc 14275 df-hash 14303 df-cj 15072 df-re 15073 df-im 15074 df-sqrt 15208 df-abs 15209 df-clim 15461 df-sum 15660 df-dvds 16230 df-gcd 16472 df-prm 16649 df-pc 16815 |
| This theorem is referenced by: bposlem1 27202 bposlem2 27203 |
| Copyright terms: Public domain | W3C validator |