| 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 3938 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → 𝑚 ∈ ℕ) |
| 3 | musum 27406 | . . . . . 6 ⊢ (𝑚 ∈ ℕ → Σ𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} (μ‘𝑘) = if(𝑚 = 1, 1, 0)) | |
| 4 | 2, 3 | syl 18 | . . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → Σ𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} (μ‘𝑘) = if(𝑚 = 1, 1, 0)) |
| 5 | 4 | oveq1d 7434 | . . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → (Σ𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} (μ‘𝑘) · 𝐵) = (if(𝑚 = 1, 1, 0) · 𝐵)) |
| 6 | fzfid 14027 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → (1...𝑚) ∈ Fin) | |
| 7 | dvdsssfz1 16398 | . . . . . . 7 ⊢ (𝑚 ∈ ℕ → {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} ⊆ (1...𝑚)) | |
| 8 | 2, 7 | syl 18 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} ⊆ (1...𝑚)) |
| 9 | 6, 8 | ssfid 9236 | . . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} ∈ Fin) |
| 10 | musumsum.5 | . . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → 𝐵 ∈ ℂ) | |
| 11 | elrabi 3648 | . . . . . . . 8 ⊢ (𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} → 𝑘 ∈ ℕ) | |
| 12 | mucl 27356 | . . . . . . . 8 ⊢ (𝑘 ∈ ℕ → (μ‘𝑘) ∈ ℤ) | |
| 13 | 11, 12 | syl 18 | . . . . . . 7 ⊢ (𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} → (μ‘𝑘) ∈ ℤ) |
| 14 | 13 | zcnd 12717 | . . . . . 6 ⊢ (𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} → (μ‘𝑘) ∈ ℂ) |
| 15 | 14 | adantl 487 | . . . . 5 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ 𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚}) → (μ‘𝑘) ∈ ℂ) |
| 16 | 9, 10, 15 | fsummulc1 15859 | . . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → (Σ𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} (μ‘𝑘) · 𝐵) = Σ𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} ((μ‘𝑘) · 𝐵)) |
| 17 | ovif 7517 | . . . . 5 ⊢ (if(𝑚 = 1, 1, 0) · 𝐵) = if(𝑚 = 1, (1 · 𝐵), (0 · 𝐵)) | |
| 18 | velsn 4607 | . . . . . . . . 9 ⊢ (𝑚 ∈ {1} ↔ 𝑚 = 1) | |
| 19 | 18 | bicomi 227 | . . . . . . . 8 ⊢ (𝑚 = 1 ↔ 𝑚 ∈ {1}) |
| 20 | 19 | a1i 11 | . . . . . . 7 ⊢ (𝐵 ∈ ℂ → (𝑚 = 1 ↔ 𝑚 ∈ {1})) |
| 21 | mullid 11222 | . . . . . . 7 ⊢ (𝐵 ∈ ℂ → (1 · 𝐵) = 𝐵) | |
| 22 | mul02 11403 | . . . . . . 7 ⊢ (𝐵 ∈ ℂ → (0 · 𝐵) = 0) | |
| 23 | 20, 21, 22 | ifbieq12d 4518 | . . . . . 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 2812 | . . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → (if(𝑚 = 1, 1, 0) · 𝐵) = if(𝑚 ∈ {1}, 𝐵, 0)) |
| 26 | 5, 16, 25 | 3eqtr3d 2808 | . . 3 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → Σ𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} ((μ‘𝑘) · 𝐵) = if(𝑚 ∈ {1}, 𝐵, 0)) |
| 27 | 26 | sumeq2dv 15777 | . 2 ⊢ (𝜑 → Σ𝑚 ∈ 𝐴 Σ𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} ((μ‘𝑘) · 𝐵) = Σ𝑚 ∈ 𝐴 if(𝑚 ∈ {1}, 𝐵, 0)) |
| 28 | musumsum.4 | . . . 4 ⊢ (𝜑 → 1 ∈ 𝐴) | |
| 29 | 28 | snssd 4754 | . . 3 ⊢ (𝜑 → {1} ⊆ 𝐴) |
| 30 | 29 | sselda 3938 | . . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ {1}) → 𝑚 ∈ 𝐴) |
| 31 | 30, 10 | syldan 603 | . . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ {1}) → 𝐵 ∈ ℂ) |
| 32 | 31 | ralrimiva 3159 | . . 3 ⊢ (𝜑 → ∀𝑚 ∈ {1}𝐵 ∈ ℂ) |
| 33 | musumsum.2 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ Fin) | |
| 34 | 33 | olcd 888 | . . 3 ⊢ (𝜑 → (𝐴 ⊆ (ℤ≥‘1) ∨ 𝐴 ∈ Fin)) |
| 35 | sumss2 15800 | . . 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 2850 | . . . 4 ⊢ (𝑚 = 1 → (𝐵 ∈ ℂ ↔ 𝐶 ∈ ℂ)) |
| 39 | 10 | ralrimiva 3159 | . . . 4 ⊢ (𝜑 → ∀𝑚 ∈ 𝐴 𝐵 ∈ ℂ) |
| 40 | 38, 39, 28 | rspcdva 3584 | . . 3 ⊢ (𝜑 → 𝐶 ∈ ℂ) |
| 41 | 37 | sumsn 15820 | . . 3 ⊢ ((1 ∈ 𝐴 ∧ 𝐶 ∈ ℂ) → Σ𝑚 ∈ {1}𝐵 = 𝐶) |
| 42 | 28, 40, 41 | syl2anc 596 | . 2 ⊢ (𝜑 → Σ𝑚 ∈ {1}𝐵 = 𝐶) |
| 43 | 27, 36, 42 | 3eqtr2d 2806 | 1 ⊢ (𝜑 → Σ𝑚 ∈ 𝐴 Σ𝑘 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑚} ((μ‘𝑘) · 𝐵) = 𝐶) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 = wceq 1570 ∈ wcel 2146 ∀wral 3081 {crab 3418 ⊆ wss 3906 ifcif 4489 {csn 4591 class class class wbr 5111 ‘cfv 6540 (class class class)co 7419 Fincfn 8949 ℂcc 11113 0cc0 11115 1c1 11116 · cmul 11120 ℕcn 12248 ℤcz 12606 ℤ≥cuz 12878 ...cfz 13551 Σcsu 15761 ∥ cdvds 16332 μcmu 27310 |
| 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 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-inf2 9617 ax-cnex 11171 ax-resscn 11172 ax-1cn 11173 ax-icn 11174 ax-addcl 11175 ax-addrcl 11176 ax-mulcl 11177 ax-mulrcl 11178 ax-mulcom 11179 ax-addass 11180 ax-mulass 11181 ax-distr 11182 ax-i2m1 11183 ax-1ne0 11184 ax-1rid 11185 ax-rnegex 11186 ax-rrecex 11187 ax-cnre 11188 ax-pre-lttri 11189 ax-pre-lttrn 11190 ax-pre-ltadd 11191 ax-pre-mulgt0 11192 ax-pre-sup 11193 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-int 4915 df-iun 4960 df-disj 5079 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-se 5617 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-isom 6549 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7869 df-1st 7992 df-2nd 7993 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-2o 8460 df-oadd 8463 df-er 8700 df-map 8832 df-en 8950 df-dom 8951 df-sdom 8952 df-fin 8953 df-sup 9409 df-inf 9410 df-oi 9479 df-dju 9903 df-card 9941 df-pnf 11260 df-mnf 11261 df-xr 11262 df-ltxr 11263 df-le 11264 df-sub 11458 df-neg 11459 df-div 11887 df-nn 12249 df-2 12318 df-3 12319 df-n0 12520 df-xnn0 12593 df-z 12607 df-uz 12879 df-q 12989 df-rp 13033 df-fz 13552 df-fzo 13700 df-fl 13843 df-mod 13921 df-seq 14056 df-exp 14116 df-fac 14328 df-bc 14357 df-hash 14385 df-cj 15174 df-re 15175 df-im 15176 df-sqrt 15310 df-abs 15311 df-clim 15563 df-sum 15762 df-dvds 16333 df-gcd 16575 df-prm 16752 df-pc 16919 df-mu 27316 |
| This theorem is used by: dchrmusum2 27709 dchrvmasum2lem 27711 mudivsum 27745 mulogsum 27747 mulog2sumlem2 27750 |
| Copyright terms: Public domain | W3C validator |