| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > muval2 | Structured version Visualization version GIF version | ||
| Description: The value of the Möbius function at a squarefree number. (Contributed by Mario Carneiro, 3-Oct-2014.) |
| Ref | Expression |
|---|---|
| muval2 | ⊢ ((𝐴 ∈ ℕ ∧ (μ‘𝐴) ≠ 0) → (μ‘𝐴) = ( -1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ne 2960 | . . 3 ⊢ ((μ‘𝐴) ≠ 0 ↔ ¬ (μ‘𝐴) = 0) | |
| 2 | ifeqor 4537 | . . . . 5 ⊢ (if(∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐴, 0, ( -1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}))) = 0 ∨ if(∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐴, 0, ( -1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}))) = ( -1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}))) | |
| 3 | muval 27516 | . . . . . . 7 ⊢ (𝐴 ∈ ℕ → (μ‘𝐴) = if(∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐴, 0, ( -1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴})))) | |
| 4 | 3 | eqeq1d 2765 | . . . . . 6 ⊢ (𝐴 ∈ ℕ → ((μ‘𝐴) = 0 ↔ if(∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐴, 0, ( -1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}))) = 0)) |
| 5 | 3 | eqeq1d 2765 | . . . . . 6 ⊢ (𝐴 ∈ ℕ → ((μ‘𝐴) = ( -1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴})) ↔ if(∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐴, 0, ( -1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}))) = ( -1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴})))) |
| 6 | 4, 5 | orbi12d 932 | . . . . 5 ⊢ (𝐴 ∈ ℕ → (((μ‘𝐴) = 0 ∨ (μ‘𝐴) = ( -1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}))) ↔ (if(∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐴, 0, ( -1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}))) = 0 ∨ if(∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐴, 0, ( -1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}))) = ( -1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}))))) |
| 7 | 2, 6 | mpbiri 261 | . . . 4 ⊢ (𝐴 ∈ ℕ → ((μ‘𝐴) = 0 ∨ (μ‘𝐴) = ( -1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴})))) |
| 8 | 7 | ord 878 | . . 3 ⊢ (𝐴 ∈ ℕ → (¬ (μ‘𝐴) = 0 → (μ‘𝐴) = ( -1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴})))) |
| 9 | 1, 8 | biimtrid 245 | . 2 ⊢ (𝐴 ∈ ℕ → ((μ‘𝐴) ≠ 0 → (μ‘𝐴) = ( -1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴})))) |
| 10 | 9 | imp 412 | 1 ⊢ ((𝐴 ∈ ℕ ∧ (μ‘𝐴) ≠ 0) → (μ‘𝐴) = ( -1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 ∨ wo 861 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 ∃wrex 3090 {crab 3416 ifcif 4485 class class class wbr 5108 ‘cfv 6566 (class class class)co 7451 0cc0 11239 1c1 11240 -cneg 11581 ℕcn 12375 2c2 12437 ↑cexp 14244 ♯chash 14515 ∥ cdvds 16466 ℙcprime 16890 μ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-sep 5255 ax-nul 5266 ax-pr 5398 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-mulcl 11301 ax-i2m1 11307 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 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-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-iota 6520 df-fun 6568 df-fv 6574 df-ov 7454 df-mu 27485 |
| This theorem is used by: mumul 27565 musum 27575 |
| Copyright terms: Public domain | W3C validator |