| 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 3913 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → 𝑚 ∈ ℕ) |
| 3 | musum 27575 | . . . . . 6 ⊢ (𝑚 ∈ ℕ → Σ𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} (μ‘𝑘) = if(𝑚 = 1, 1, 0)) | |
| 4 | 2, 3 | syl 18 | . . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → Σ𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} (μ‘𝑘) = if(𝑚 = 1, 1, 0)) |
| 5 | 4 | oveq1d 7466 | . . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → (Σ𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} (μ‘𝑘) · 𝐵) = (if(𝑚 = 1, 1, 0) · 𝐵)) |
| 6 | fzfid 14156 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → (1...𝑚) ∈ Fin) | |
| 7 | dvdsssfz1 16532 | . . . . . . 7 ⊢ (𝑚 ∈ ℕ → {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} ⊆ (1...𝑚)) | |
| 8 | 2, 7 | syl 18 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} ⊆ (1...𝑚)) |
| 9 | 6, 8 | ssfid 9298 | . . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} ∈ Fin) |
| 10 | musumsum.5 | . . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → 𝐵 ∈ ℂ) | |
| 11 | elrabi 3644 | . . . . . . . 8 ⊢ (𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} → 𝑘 ∈ ℕ) | |
| 12 | mucl 27525 | . . . . . . . 8 ⊢ (𝑘 ∈ ℕ → (μ‘𝑘) ∈ ℤ) | |
| 13 | 11, 12 | syl 18 | . . . . . . 7 ⊢ (𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} → (μ‘𝑘) ∈ ℤ) |
| 14 | 13 | zcnd 12844 | . . . . . 6 ⊢ (𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} → (μ‘𝑘) ∈ ℂ) |
| 15 | 14 | adantl 487 | . . . . 5 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ 𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚}) → (μ‘𝑘) ∈ ℂ) |
| 16 | 9, 10, 15 | fsummulc1 15995 | . . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → (Σ𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} (μ‘𝑘) · 𝐵) = Σ𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} ((μ‘𝑘) · 𝐵)) |
| 17 | ovif 7549 | . . . . 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 11346 | . . . . . . 7 ⊢ (𝐵 ∈ ℂ → (1 · 𝐵) = 𝐵) | |
| 22 | mul02 11527 | . . . . . . 7 ⊢ (𝐵 ∈ ℂ → (0 · 𝐵) = 0) | |
| 23 | 20, 21, 22 | ifbieq12d 4514 | . . . . . 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 15913 | . 2 ⊢ (𝜑 → Σ𝑚 ∈ 𝐴 Σ𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} ((μ‘𝑘) · 𝐵) = Σ𝑚 ∈ 𝐴 if(𝑚 ∈ {1}, 𝐵, 0)) |
| 28 | musumsum.4 | . . . 4 ⊢ (𝜑 → 1 ∈ 𝐴) | |
| 29 | 28 | snssd 4749 | . . 3 ⊢ (𝜑 → {1} ⊆ 𝐴) |
| 30 | 29 | sselda 3913 | . . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ {1}) → 𝑚 ∈ 𝐴) |
| 31 | 30, 10 | syldan 603 | . . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ {1}) → 𝐵 ∈ ℂ) |
| 32 | 31 | ralrimiva 3158 | . . 3 ⊢ (𝜑 → ∀𝑚 ∈ {1}𝐵 ∈ ℂ) |
| 33 | musumsum.2 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ Fin) | |
| 34 | 33 | olcd 888 | . . 3 ⊢ (𝜑 → (𝐴 ⊆ (ℤ≥‘1) ∨ 𝐴 ∈ Fin)) |
| 35 | sumss2 15936 | . . 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 2849 | . . . 4 ⊢ (𝑚 = 1 → (𝐵 ∈ ℂ ↔ 𝐶 ∈ ℂ)) |
| 39 | 10 | ralrimiva 3158 | . . . 4 ⊢ (𝜑 → ∀𝑚 ∈ 𝐴 𝐵 ∈ ℂ) |
| 40 | 38, 39, 28 | rspcdva 3581 | . . 3 ⊢ (𝜑 → 𝐶 ∈ ℂ) |
| 41 | 37 | sumsn 15956 | . . 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 1570 ∈ wcel 2147 ∀wral 3080 {crab 3416 ⊆ wss 3900 ifcif 4485 {csn 4588 class class class wbr 5108 ‘cfv 6566 (class class class)co 7451 Fincfn 9011 ℂcc 11237 0cc0 11239 1c1 11240 · cmul 11244 ℕcn 12375 ℤcz 12733 ℤ≥cuz 13005 ...cfz 13679 Σcsu 15897 ∥ cdvds 16466 μcmu 27479 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-inf2 9679 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 ax-pre-sup 11317 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-disj 5076 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-se 5612 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-isom 6575 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-2o 8515 df-oadd 8518 df-er 8755 df-map 8887 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-sup 9471 df-inf 9472 df-oi 9541 df-dju 10019 df-card 10057 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-div 12014 df-nn 12376 df-2 12445 df-3 12446 df-n0 12647 df-xnn0 12720 df-z 12734 df-uz 13006 df-q 13116 df-rp 13161 df-fz 13680 df-fzo 13829 df-fl 13972 df-mod 14050 df-seq 14185 df-exp 14245 df-fac 14459 df-bc 14488 df-hash 14516 df-cj 15309 df-re 15310 df-im 15311 df-sqrt 15445 df-abs 15446 df-clim 15699 df-sum 15898 df-dvds 16467 df-gcd 16709 df-prm 16891 df-pc 17059 df-mu 27485 |
| This theorem is used by: dchrmusum2 27878 dchrvmasum2lem 27880 mudivsum 27914 mulogsum 27916 mulog2sumlem2 27919 |
| Copyright terms: Public domain | W3C validator |