| 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 12332 | . . . . 5 ⊢ 2 ∈ ℕ | |
| 2 | nnmulcl 12275 | . . . . 5 ⊢ ((2 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (2 · 𝑁) ∈ ℕ) | |
| 3 | 1, 2 | mpan 703 | . . . 4 ⊢ (𝑁 ∈ ℕ → (2 · 𝑁) ∈ ℕ) |
| 4 | 3 | adantr 486 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝑃 ∈ ℙ) → (2 · 𝑁) ∈ ℕ) |
| 5 | nnnn0 12529 | . . . . 5 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℕ0) | |
| 6 | fzctr 13687 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ (0...(2 · 𝑁))) | |
| 7 | 5, 6 | syl 18 | . . . 4 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ (0...(2 · 𝑁))) |
| 8 | 7 | adantr 486 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝑃 ∈ ℙ) → 𝑁 ∈ (0...(2 · 𝑁))) |
| 9 | simpr 490 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝑃 ∈ ℙ) → 𝑃 ∈ ℙ) | |
| 10 | pcbc 16985 | . . 3 ⊢ (((2 · 𝑁) ∈ ℕ ∧ 𝑁 ∈ (0...(2 · 𝑁)) ∧ 𝑃 ∈ ℙ) → (𝑃 pCnt ((2 · 𝑁)C𝑁)) = Σ𝑘 ∈ (1...(2 · 𝑁))((⌊‘((2 · 𝑁) / (𝑃↑𝑘))) − ((⌊‘(((2 · 𝑁) − 𝑁) / (𝑃↑𝑘))) + (⌊‘(𝑁 / (𝑃↑𝑘)))))) | |
| 11 | 4, 8, 9, 10 | syl3anc 1398 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝑃 ∈ ℙ) → (𝑃 pCnt ((2 · 𝑁)C𝑁)) = Σ𝑘 ∈ (1...(2 · 𝑁))((⌊‘((2 · 𝑁) / (𝑃↑𝑘))) − ((⌊‘(((2 · 𝑁) − 𝑁) / (𝑃↑𝑘))) + (⌊‘(𝑁 / (𝑃↑𝑘)))))) |
| 12 | nncn 12259 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℂ) | |
| 13 | 12 | 2timesd 12505 | . . . . . . . . 9 ⊢ (𝑁 ∈ ℕ → (2 · 𝑁) = (𝑁 + 𝑁)) |
| 14 | 12, 12, 13 | mvrladdd 11645 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ → ((2 · 𝑁) − 𝑁) = 𝑁) |
| 15 | 14 | fvoveq1d 7445 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ → (⌊‘(((2 · 𝑁) − 𝑁) / (𝑃↑𝑘))) = (⌊‘(𝑁 / (𝑃↑𝑘)))) |
| 16 | 15 | oveq1d 7438 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → ((⌊‘(((2 · 𝑁) − 𝑁) / (𝑃↑𝑘))) + (⌊‘(𝑁 / (𝑃↑𝑘)))) = ((⌊‘(𝑁 / (𝑃↑𝑘))) + (⌊‘(𝑁 / (𝑃↑𝑘))))) |
| 17 | 16 | ad2antrr 739 | . . . . 5 ⊢ (((𝑁 ∈ ℕ ∧ 𝑃 ∈ ℙ) ∧ 𝑘 ∈ (1...(2 · 𝑁))) → ((⌊‘(((2 · 𝑁) − 𝑁) / (𝑃↑𝑘))) + (⌊‘(𝑁 / (𝑃↑𝑘)))) = ((⌊‘(𝑁 / (𝑃↑𝑘))) + (⌊‘(𝑁 / (𝑃↑𝑘))))) |
| 18 | nnre 12258 | . . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℝ) | |
| 19 | 18 | ad2antrr 739 | . . . . . . . . 9 ⊢ (((𝑁 ∈ ℕ ∧ 𝑃 ∈ ℙ) ∧ 𝑘 ∈ (1...(2 · 𝑁))) → 𝑁 ∈ ℝ) |
| 20 | prmnn 16757 | . . . . . . . . . . 11 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ) | |
| 21 | 20 | adantl 487 | . . . . . . . . . 10 ⊢ ((𝑁 ∈ ℕ ∧ 𝑃 ∈ ℙ) → 𝑃 ∈ ℕ) |
| 22 | elfznn 13600 | . . . . . . . . . . 11 ⊢ (𝑘 ∈ (1...(2 · 𝑁)) → 𝑘 ∈ ℕ) | |
| 23 | 22 | nnnn0d 12583 | . . . . . . . . . 10 ⊢ (𝑘 ∈ (1...(2 · 𝑁)) → 𝑘 ∈ ℕ0) |
| 24 | nnexpcl 14130 | . . . . . . . . . 10 ⊢ ((𝑃 ∈ ℕ ∧ 𝑘 ∈ ℕ0) → (𝑃↑𝑘) ∈ ℕ) | |
| 25 | 21, 23, 24 | syl2an 608 | . . . . . . . . 9 ⊢ (((𝑁 ∈ ℕ ∧ 𝑃 ∈ ℙ) ∧ 𝑘 ∈ (1...(2 · 𝑁))) → (𝑃↑𝑘) ∈ ℕ) |
| 26 | 19, 25 | nndivred 12308 | . . . . . . . 8 ⊢ (((𝑁 ∈ ℕ ∧ 𝑃 ∈ ℙ) ∧ 𝑘 ∈ (1...(2 · 𝑁))) → (𝑁 / (𝑃↑𝑘)) ∈ ℝ) |
| 27 | 26 | flcld 13851 | . . . . . . 7 ⊢ (((𝑁 ∈ ℕ ∧ 𝑃 ∈ ℙ) ∧ 𝑘 ∈ (1...(2 · 𝑁))) → (⌊‘(𝑁 / (𝑃↑𝑘))) ∈ ℤ) |
| 28 | 27 | zcnd 12719 | . . . . . 6 ⊢ (((𝑁 ∈ ℕ ∧ 𝑃 ∈ ℙ) ∧ 𝑘 ∈ (1...(2 · 𝑁))) → (⌊‘(𝑁 / (𝑃↑𝑘))) ∈ ℂ) |
| 29 | 28 | 2timesd 12505 | . . . . 5 ⊢ (((𝑁 ∈ ℕ ∧ 𝑃 ∈ ℙ) ∧ 𝑘 ∈ (1...(2 · 𝑁))) → (2 · (⌊‘(𝑁 / (𝑃↑𝑘)))) = ((⌊‘(𝑁 / (𝑃↑𝑘))) + (⌊‘(𝑁 / (𝑃↑𝑘))))) |
| 30 | 17, 29 | eqtr4d 2804 | . . . 4 ⊢ (((𝑁 ∈ ℕ ∧ 𝑃 ∈ ℙ) ∧ 𝑘 ∈ (1...(2 · 𝑁))) → ((⌊‘(((2 · 𝑁) − 𝑁) / (𝑃↑𝑘))) + (⌊‘(𝑁 / (𝑃↑𝑘)))) = (2 · (⌊‘(𝑁 / (𝑃↑𝑘))))) |
| 31 | 30 | oveq2d 7439 | . . 3 ⊢ (((𝑁 ∈ ℕ ∧ 𝑃 ∈ ℙ) ∧ 𝑘 ∈ (1...(2 · 𝑁))) → ((⌊‘((2 · 𝑁) / (𝑃↑𝑘))) − ((⌊‘(((2 · 𝑁) − 𝑁) / (𝑃↑𝑘))) + (⌊‘(𝑁 / (𝑃↑𝑘))))) = ((⌊‘((2 · 𝑁) / (𝑃↑𝑘))) − (2 · (⌊‘(𝑁 / (𝑃↑𝑘)))))) |
| 32 | 31 | sumeq2dv 15779 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝑃 ∈ ℙ) → Σ𝑘 ∈ (1...(2 · 𝑁))((⌊‘((2 · 𝑁) / (𝑃↑𝑘))) − ((⌊‘(((2 · 𝑁) − 𝑁) / (𝑃↑𝑘))) + (⌊‘(𝑁 / (𝑃↑𝑘))))) = Σ𝑘 ∈ (1...(2 · 𝑁))((⌊‘((2 · 𝑁) / (𝑃↑𝑘))) − (2 · (⌊‘(𝑁 / (𝑃↑𝑘)))))) |
| 33 | 11, 32 | eqtrd 2801 | 1 ⊢ ((𝑁 ∈ ℕ ∧ 𝑃 ∈ ℙ) → (𝑃 pCnt ((2 · 𝑁)C𝑁)) = Σ𝑘 ∈ (1...(2 · 𝑁))((⌊‘((2 · 𝑁) / (𝑃↑𝑘))) − (2 · (⌊‘(𝑁 / (𝑃↑𝑘)))))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ‘cfv 6543 (class class class)co 7423 ℝcr 11117 0cc0 11118 1c1 11119 + caddc 11121 · cmul 11123 − cmin 11459 / cdiv 11889 ℕcn 12251 2c2 12313 ℕ0cn0 12522 ...cfz 13553 ⌊cfl 13843 ↑cexp 14117 Ccbc 14358 Σcsu 15763 ℙcprime 16754 pCnt cpc 16921 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-rep 5243 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 ax-inf2 9620 ax-cnex 11174 ax-resscn 11175 ax-1cn 11176 ax-icn 11177 ax-addcl 11178 ax-addrcl 11179 ax-mulcl 11180 ax-mulrcl 11181 ax-mulcom 11182 ax-addass 11183 ax-mulass 11184 ax-distr 11185 ax-i2m1 11186 ax-1ne0 11187 ax-1rid 11188 ax-rnegex 11189 ax-rrecex 11190 ax-cnre 11191 ax-pre-lttri 11192 ax-pre-lttrn 11193 ax-pre-ltadd 11194 ax-pre-mulgt0 11195 ax-pre-sup 11196 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-nel 3068 df-ral 3083 df-rex 3093 df-rmo 3372 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3928 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-int 4918 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-tr 5224 df-id 5561 df-eprel 5566 df-po 5574 df-so 5575 df-fr 5619 df-se 5620 df-we 5621 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-pred 6309 df-ord 6370 df-on 6371 df-lim 6372 df-suc 6373 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-isom 6552 df-riota 7380 df-ov 7426 df-oprab 7427 df-mpo 7428 df-om 7872 df-1st 7995 df-2nd 7996 df-frecs 8287 df-wrecs 8318 df-recs 8367 df-rdg 8406 df-1o 8462 df-2o 8463 df-er 8703 df-en 8953 df-dom 8954 df-sdom 8955 df-fin 8956 df-sup 9412 df-inf 9413 df-oi 9482 df-card 9944 df-pnf 11263 df-mnf 11264 df-xr 11265 df-ltxr 11266 df-le 11267 df-sub 11461 df-neg 11462 df-div 11890 df-nn 12252 df-2 12321 df-3 12322 df-n0 12523 df-z 12610 df-uz 12881 df-q 12991 df-rp 13035 df-fz 13554 df-fzo 13702 df-fl 13845 df-mod 13923 df-seq 14058 df-exp 14118 df-fac 14330 df-bc 14359 df-hash 14387 df-cj 15176 df-re 15177 df-im 15178 df-sqrt 15312 df-abs 15313 df-clim 15565 df-sum 15764 df-dvds 16336 df-gcd 16578 df-prm 16755 df-pc 16922 |
| This theorem is used by: bposlem1 27485 bposlem2 27486 |
| Copyright terms: Public domain | W3C validator |