| 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 3912 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → 𝑚 ∈ ℕ) |
| 3 | musum 27530 | . . . . . 6 ⊢ (𝑚 ∈ ℕ → Σ𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} (μ‘𝑘) = if(𝑚 = 1, 1, 0)) | |
| 4 | 2, 3 | syl 18 | . . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → Σ𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} (μ‘𝑘) = if(𝑚 = 1, 1, 0)) |
| 5 | 4 | oveq1d 7442 | . . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → (Σ𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} (μ‘𝑘) · 𝐵) = (if(𝑚 = 1, 1, 0) · 𝐵)) |
| 6 | fzfid 14126 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → (1...𝑚) ∈ Fin) | |
| 7 | dvdsssfz1 16500 | . . . . . . 7 ⊢ (𝑚 ∈ ℕ → {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} ⊆ (1...𝑚)) | |
| 8 | 2, 7 | syl 18 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} ⊆ (1...𝑚)) |
| 9 | 6, 8 | ssfid 9271 | . . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} ∈ Fin) |
| 10 | musumsum.5 | . . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → 𝐵 ∈ ℂ) | |
| 11 | elrabi 3643 | . . . . . . . 8 ⊢ (𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} → 𝑘 ∈ ℕ) | |
| 12 | mucl 27480 | . . . . . . . 8 ⊢ (𝑘 ∈ ℕ → (μ‘𝑘) ∈ ℤ) | |
| 13 | 11, 12 | syl 18 | . . . . . . 7 ⊢ (𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} → (μ‘𝑘) ∈ ℤ) |
| 14 | 13 | zcnd 12814 | . . . . . 6 ⊢ (𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} → (μ‘𝑘) ∈ ℂ) |
| 15 | 14 | adantl 487 | . . . . 5 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ 𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚}) → (μ‘𝑘) ∈ ℂ) |
| 16 | 9, 10, 15 | fsummulc1 15963 | . . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → (Σ𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} (μ‘𝑘) · 𝐵) = Σ𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} ((μ‘𝑘) · 𝐵)) |
| 17 | ovif 7525 | . . . . 5 ⊢ (if(𝑚 = 1, 1, 0) · 𝐵) = if(𝑚 = 1, (1 · 𝐵), (0 · 𝐵)) | |
| 18 | velsn 4599 | . . . . . . . . 9 ⊢ (𝑚 ∈ {1} ↔ 𝑚 = 1) | |
| 19 | 18 | bicomi 227 | . . . . . . . 8 ⊢ (𝑚 = 1 ↔ 𝑚 ∈ {1}) |
| 20 | 19 | a1i 11 | . . . . . . 7 ⊢ (𝐵 ∈ ℂ → (𝑚 = 1 ↔ 𝑚 ∈ {1})) |
| 21 | mullid 11317 | . . . . . . 7 ⊢ (𝐵 ∈ ℂ → (1 · 𝐵) = 𝐵) | |
| 22 | mul02 11498 | . . . . . . 7 ⊢ (𝐵 ∈ ℂ → (0 · 𝐵) = 0) | |
| 23 | 20, 21, 22 | ifbieq12d 4513 | . . . . . 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 2810 | . . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → (if(𝑚 = 1, 1, 0) · 𝐵) = if(𝑚 ∈ {1}, 𝐵, 0)) |
| 26 | 5, 16, 25 | 3eqtr3d 2806 | . . 3 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → Σ𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} ((μ‘𝑘) · 𝐵) = if(𝑚 ∈ {1}, 𝐵, 0)) |
| 27 | 26 | sumeq2dv 15881 | . 2 ⊢ (𝜑 → Σ𝑚 ∈ 𝐴 Σ𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} ((μ‘𝑘) · 𝐵) = Σ𝑚 ∈ 𝐴 if(𝑚 ∈ {1}, 𝐵, 0)) |
| 28 | musumsum.4 | . . . 4 ⊢ (𝜑 → 1 ∈ 𝐴) | |
| 29 | 28 | snssd 4746 | . . 3 ⊢ (𝜑 → {1} ⊆ 𝐴) |
| 30 | 29 | sselda 3912 | . . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ {1}) → 𝑚 ∈ 𝐴) |
| 31 | 30, 10 | syldan 603 | . . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ {1}) → 𝐵 ∈ ℂ) |
| 32 | 31 | ralrimiva 3157 | . . 3 ⊢ (𝜑 → ∀𝑚 ∈ {1}𝐵 ∈ ℂ) |
| 33 | musumsum.2 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ Fin) | |
| 34 | 33 | olcd 888 | . . 3 ⊢ (𝜑 → (𝐴 ⊆ (ℤ≥‘1) ∨ 𝐴 ∈ Fin)) |
| 35 | sumss2 15904 | . . 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 2848 | . . . 4 ⊢ (𝑚 = 1 → (𝐵 ∈ ℂ ↔ 𝐶 ∈ ℂ)) |
| 39 | 10 | ralrimiva 3157 | . . . 4 ⊢ (𝜑 → ∀𝑚 ∈ 𝐴 𝐵 ∈ ℂ) |
| 40 | 38, 39, 28 | rspcdva 3580 | . . 3 ⊢ (𝜑 → 𝐶 ∈ ℂ) |
| 41 | 37 | sumsn 15924 | . . 3 ⊢ ((1 ∈ 𝐴 ∧ 𝐶 ∈ ℂ) → Σ𝑚 ∈ {1}𝐵 = 𝐶) |
| 42 | 28, 40, 41 | syl2anc 596 | . 2 ⊢ (𝜑 → Σ𝑚 ∈ {1}𝐵 = 𝐶) |
| 43 | 27, 36, 42 | 3eqtr2d 2804 | 1 ⊢ (𝜑 → Σ𝑚 ∈ 𝐴 Σ𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} ((μ‘𝑘) · 𝐵) = 𝐶) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 = wceq 1569 ∈ wcel 2146 ∀wral 3079 {crab 3415 ⊆ wss 3899 ifcif 4484 {csn 4587 class class class wbr 5105 ‘cfv 6546 (class class class)co 7427 Fincfn 8984 ℂcc 11208 0cc0 11210 1c1 11211 · cmul 11215 ℕcn 12345 ℤcz 12703 ℤ≥cuz 12975 ...cfz 13649 Σcsu 15865 ∥ cdvds 16434 μcmu 27434 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-rep 5234 ax-sep 5251 ax-nul 5262 ax-pow 5330 ax-pr 5394 ax-un 7758 ax-inf2 9652 ax-cnex 11266 ax-resscn 11267 ax-1cn 11268 ax-icn 11269 ax-addcl 11270 ax-addrcl 11271 ax-mulcl 11272 ax-mulrcl 11273 ax-mulcom 11274 ax-addass 11275 ax-mulass 11276 ax-distr 11277 ax-i2m1 11278 ax-1ne0 11279 ax-1rid 11280 ax-rnegex 11281 ax-rrecex 11282 ax-cnre 11283 ax-pre-lttri 11284 ax-pre-lttrn 11285 ax-pre-ltadd 11286 ax-pre-mulgt0 11287 ax-pre-sup 11288 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4838 df-uni 4870 df-int 4910 df-iun 4955 df-disj 5073 df-br 5106 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5549 df-eprel 5554 df-po 5562 df-so 5563 df-fr 5607 df-se 5608 df-we 5609 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6310 df-ord 6371 df-on 6372 df-lim 6373 df-suc 6374 df-iota 6500 df-fun 6548 df-fn 6549 df-f 6550 df-f1 6551 df-fo 6552 df-f1o 6553 df-fv 6554 df-isom 6555 df-riota 7384 df-ov 7430 df-oprab 7431 df-mpo 7432 df-om 7885 df-1st 8008 df-2nd 8009 df-frecs 8310 df-wrecs 8341 df-recs 8390 df-rdg 8429 df-1o 8487 df-2o 8488 df-oadd 8491 df-er 8728 df-map 8860 df-en 8985 df-dom 8986 df-sdom 8987 df-fin 8988 df-sup 9444 df-inf 9445 df-oi 9514 df-dju 9992 df-card 10030 df-pnf 11355 df-mnf 11356 df-xr 11357 df-ltxr 11358 df-le 11359 df-sub 11553 df-neg 11554 df-div 11984 df-nn 12346 df-2 12415 df-3 12416 df-n0 12617 df-xnn0 12690 df-z 12704 df-uz 12976 df-q 13086 df-rp 13131 df-fz 13650 df-fzo 13799 df-fl 13942 df-mod 14020 df-seq 14155 df-exp 14215 df-fac 14428 df-bc 14457 df-hash 14485 df-cj 15278 df-re 15279 df-im 15280 df-sqrt 15414 df-abs 15415 df-clim 15667 df-sum 15866 df-dvds 16435 df-gcd 16677 df-prm 16859 df-pc 17027 df-mu 27440 |
| This theorem is used by: dchrmusum2 27833 dchrvmasum2lem 27835 mudivsum 27869 mulogsum 27871 mulog2sumlem2 27874 |
| Copyright terms: Public domain | W3C validator |