| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > musumsum | Structured version Visualization version GIF version | ||
| Description: Evaluate a collapsing sum over the Möbius function. (Contributed by Mario Carneiro, 4-May-2016.) |
| Ref | Expression |
|---|---|
| musumsum.1 | ⊢ (𝑚 = 1 → 𝐵 = 𝐶) |
| musumsum.2 | ⊢ (𝜑 → 𝐴 ∈ Fin) |
| musumsum.3 | ⊢ (𝜑 → 𝐴 ⊆ ℕ) |
| musumsum.4 | ⊢ (𝜑 → 1 ∈ 𝐴) |
| musumsum.5 | ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → 𝐵 ∈ ℂ) |
| Ref | Expression |
|---|---|
| musumsum | ⊢ (𝜑 → Σ𝑚 ∈ 𝐴 Σ𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} ((μ‘𝑘) · 𝐵) = 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | musumsum.3 | . . . . . . 7 ⊢ (𝜑 → 𝐴 ⊆ ℕ) | |
| 2 | 1 | sselda 3931 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → 𝑚 ∈ ℕ) |
| 3 | musum 27511 | . . . . . 6 ⊢ (𝑚 ∈ ℕ → Σ𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} (μ‘𝑘) = if(𝑚 = 1, 1, 0)) | |
| 4 | 2, 3 | syl 18 | . . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → Σ𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} (μ‘𝑘) = if(𝑚 = 1, 1, 0)) |
| 5 | 4 | oveq1d 7433 | . . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → (Σ𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} (μ‘𝑘) · 𝐵) = (if(𝑚 = 1, 1, 0) · 𝐵)) |
| 6 | fzfid 14109 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → (1...𝑚) ∈ Fin) | |
| 7 | dvdsssfz1 16481 | . . . . . . 7 ⊢ (𝑚 ∈ ℕ → {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} ⊆ (1...𝑚)) | |
| 8 | 2, 7 | syl 18 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} ⊆ (1...𝑚)) |
| 9 | 6, 8 | ssfid 9253 | . . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} ∈ Fin) |
| 10 | musumsum.5 | . . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → 𝐵 ∈ ℂ) | |
| 11 | elrabi 3641 | . . . . . . . 8 ⊢ (𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} → 𝑘 ∈ ℕ) | |
| 12 | mucl 27461 | . . . . . . . 8 ⊢ (𝑘 ∈ ℕ → (μ‘𝑘) ∈ ℤ) | |
| 13 | 11, 12 | syl 18 | . . . . . . 7 ⊢ (𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} → (μ‘𝑘) ∈ ℤ) |
| 14 | 13 | zcnd 12797 | . . . . . 6 ⊢ (𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} → (μ‘𝑘) ∈ ℂ) |
| 15 | 14 | adantl 487 | . . . . 5 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ 𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚}) → (μ‘𝑘) ∈ ℂ) |
| 16 | 9, 10, 15 | fsummulc1 15944 | . . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → (Σ𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} (μ‘𝑘) · 𝐵) = Σ𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} ((μ‘𝑘) · 𝐵)) |
| 17 | ovif 7516 | . . . . 5 ⊢ (if(𝑚 = 1, 1, 0) · 𝐵) = if(𝑚 = 1, (1 · 𝐵), (0 · 𝐵)) | |
| 18 | velsn 4600 | . . . . . . . . 9 ⊢ (𝑚 ∈ {1} ↔ 𝑚 = 1) | |
| 19 | 18 | bicomi 227 | . . . . . . . 8 ⊢ (𝑚 = 1 ↔ 𝑚 ∈ {1}) |
| 20 | 19 | a1i 11 | . . . . . . 7 ⊢ (𝐵 ∈ ℂ → (𝑚 = 1 ↔ 𝑚 ∈ {1})) |
| 21 | mullid 11300 | . . . . . . 7 ⊢ (𝐵 ∈ ℂ → (1 · 𝐵) = 𝐵) | |
| 22 | mul02 11481 | . . . . . . 7 ⊢ (𝐵 ∈ ℂ → (0 · 𝐵) = 0) | |
| 23 | 20, 21, 22 | ifbieq12d 4511 | . . . . . 6 ⊢ (𝐵 ∈ ℂ → if(𝑚 = 1, (1 · 𝐵), (0 · 𝐵)) = if(𝑚 ∈ {1}, 𝐵, 0)) |
| 24 | 10, 23 | syl 18 | . . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → if(𝑚 = 1, (1 · 𝐵), (0 · 𝐵)) = if(𝑚 ∈ {1}, 𝐵, 0)) |
| 25 | 17, 24 | eqtrid 2808 | . . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → (if(𝑚 = 1, 1, 0) · 𝐵) = if(𝑚 ∈ {1}, 𝐵, 0)) |
| 26 | 5, 16, 25 | 3eqtr3d 2804 | . . 3 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → Σ𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} ((μ‘𝑘) · 𝐵) = if(𝑚 ∈ {1}, 𝐵, 0)) |
| 27 | 26 | sumeq2dv 15862 | . 2 ⊢ (𝜑 → Σ𝑚 ∈ 𝐴 Σ𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} ((μ‘𝑘) · 𝐵) = Σ𝑚 ∈ 𝐴 if(𝑚 ∈ {1}, 𝐵, 0)) |
| 28 | musumsum.4 | . . . 4 ⊢ (𝜑 → 1 ∈ 𝐴) | |
| 29 | 28 | snssd 4747 | . . 3 ⊢ (𝜑 → {1} ⊆ 𝐴) |
| 30 | 29 | sselda 3931 | . . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ {1}) → 𝑚 ∈ 𝐴) |
| 31 | 30, 10 | syldan 603 | . . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ {1}) → 𝐵 ∈ ℂ) |
| 32 | 31 | ralrimiva 3155 | . . 3 ⊢ (𝜑 → ∀𝑚 ∈ {1}𝐵 ∈ ℂ) |
| 33 | musumsum.2 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ Fin) | |
| 34 | 33 | olcd 888 | . . 3 ⊢ (𝜑 → (𝐴 ⊆ (ℤ≥‘1) ∨ 𝐴 ∈ Fin)) |
| 35 | sumss2 15885 | . . 3 ⊢ ((({1} ⊆ 𝐴 ∧ ∀𝑚 ∈ {1}𝐵 ∈ ℂ) ∧ (𝐴 ⊆ (ℤ≥‘1) ∨ 𝐴 ∈ Fin)) → Σ𝑚 ∈ {1}𝐵 = Σ𝑚 ∈ 𝐴 if(𝑚 ∈ {1}, 𝐵, 0)) | |
| 36 | 29, 32, 34, 35 | syl21anc 851 | . 2 ⊢ (𝜑 → Σ𝑚 ∈ {1}𝐵 = Σ𝑚 ∈ 𝐴 if(𝑚 ∈ {1}, 𝐵, 0)) |
| 37 | musumsum.1 | . . . . 5 ⊢ (𝑚 = 1 → 𝐵 = 𝐶) | |
| 38 | 37 | eleq1d 2846 | . . . 4 ⊢ (𝑚 = 1 → (𝐵 ∈ ℂ ↔ 𝐶 ∈ ℂ)) |
| 39 | 10 | ralrimiva 3155 | . . . 4 ⊢ (𝜑 → ∀𝑚 ∈ 𝐴 𝐵 ∈ ℂ) |
| 40 | 38, 39, 28 | rspcdva 3578 | . . 3 ⊢ (𝜑 → 𝐶 ∈ ℂ) |
| 41 | 37 | sumsn 15905 | . . 3 ⊢ ((1 ∈ 𝐴 ∧ 𝐶 ∈ ℂ) → Σ𝑚 ∈ {1}𝐵 = 𝐶) |
| 42 | 28, 40, 41 | syl2anc 596 | . 2 ⊢ (𝜑 → Σ𝑚 ∈ {1}𝐵 = 𝐶) |
| 43 | 27, 36, 42 | 3eqtr2d 2802 | 1 ⊢ (𝜑 → Σ𝑚 ∈ 𝐴 Σ𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} ((μ‘𝑘) · 𝐵) = 𝐶) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 = wceq 1570 ∈ wcel 2145 ∀wral 3077 {crab 3413 ⊆ wss 3899 ifcif 4482 {csn 4584 class class class wbr 5103 ‘cfv 6537 (class class class)co 7418 Fincfn 8966 ℂcc 11191 0cc0 11193 1c1 11194 · cmul 11198 ℕcn 12328 ℤcz 12686 ℤ≥cuz 12958 ...cfz 13632 Σcsu 15846 ∥ cdvds 16415 μcmu 27415 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7749 ax-inf2 9635 ax-cnex 11249 ax-resscn 11250 ax-1cn 11251 ax-icn 11252 ax-addcl 11253 ax-addrcl 11254 ax-mulcl 11255 ax-mulrcl 11256 ax-mulcom 11257 ax-addass 11258 ax-mulass 11259 ax-distr 11260 ax-i2m1 11261 ax-1ne0 11262 ax-1rid 11263 ax-rnegex 11264 ax-rrecex 11265 ax-cnre 11266 ax-pre-lttri 11267 ax-pre-lttrn 11268 ax-pre-ltadd 11269 ax-pre-mulgt0 11270 ax-pre-sup 11271 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-disj 5071 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-se 5605 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 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-isom 6546 df-riota 7375 df-ov 7421 df-oprab 7422 df-mpo 7423 df-om 7876 df-1st 7999 df-2nd 8000 df-frecs 8292 df-wrecs 8323 df-recs 8372 df-rdg 8411 df-1o 8469 df-2o 8470 df-oadd 8473 df-er 8710 df-map 8842 df-en 8967 df-dom 8968 df-sdom 8969 df-fin 8970 df-sup 9427 df-inf 9428 df-oi 9497 df-dju 9975 df-card 10013 df-pnf 11338 df-mnf 11339 df-xr 11340 df-ltxr 11341 df-le 11342 df-sub 11536 df-neg 11537 df-div 11967 df-nn 12329 df-2 12398 df-3 12399 df-n0 12600 df-xnn0 12673 df-z 12687 df-uz 12959 df-q 13069 df-rp 13114 df-fz 13633 df-fzo 13782 df-fl 13925 df-mod 14003 df-seq 14138 df-exp 14198 df-fac 14411 df-bc 14440 df-hash 14468 df-cj 15259 df-re 15260 df-im 15261 df-sqrt 15395 df-abs 15396 df-clim 15648 df-sum 15847 df-dvds 16416 df-gcd 16658 df-prm 16840 df-pc 17008 df-mu 27421 |
| This theorem is used by: dchrmusum2 27814 dchrvmasum2lem 27816 mudivsum 27850 mulogsum 27852 mulog2sumlem2 27855 |
| Copyright terms: Public domain | W3C validator |