| 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 2961 | . . 3 ⊢ ((μ‘𝐴) ≠ 0 ↔ ¬ (μ‘𝐴) = 0) | |
| 2 | ifeqor 4541 | . . . . 5 ⊢ (if(∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐴, 0, (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}))) = 0 ∨ if(∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐴, 0, (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}))) = (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}))) | |
| 3 | muval 27349 | . . . . . . 7 ⊢ (𝐴 ∈ ℕ → (μ‘𝐴) = if(∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐴, 0, (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴})))) | |
| 4 | 3 | eqeq1d 2767 | . . . . . 6 ⊢ (𝐴 ∈ ℕ → ((μ‘𝐴) = 0 ↔ if(∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐴, 0, (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}))) = 0)) |
| 5 | 3 | eqeq1d 2767 | . . . . . 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 2146 ≠ wne 2960 ∃wrex 3091 {crab 3418 ifcif 4489 class class class wbr 5111 ‘cfv 6540 (class class class)co 7419 0cc0 11117 1c1 11118 -cneg 11459 ℕcn 12250 2c2 12312 ↑cexp 14117 ♯chash 14386 ∥ cdvds 16334 ℙcprime 16753 μcmu 27312 |
| 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-sep 5259 ax-nul 5271 ax-pr 5406 ax-1cn 11175 ax-icn 11176 ax-addcl 11177 ax-mulcl 11179 ax-i2m1 11185 |
| 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 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-iota 6496 df-fun 6542 df-fv 6548 df-ov 7422 df-mu 27318 |
| This theorem is used by: mumul 27398 musum 27408 |
| Copyright terms: Public domain | W3C validator |