| 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 2956 | . . 3 ⊢ ((μ‘𝐴) ≠ 0 ↔ ¬ (μ‘𝐴) = 0) | |
| 2 | ifeqor 4533 | . . . . 5 ⊢ (if(∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐴, 0, ( -1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}))) = 0 ∨ if(∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐴, 0, ( -1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}))) = ( -1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}))) | |
| 3 | muval 27468 | . . . . . . 7 ⊢ (𝐴 ∈ ℕ → (μ‘𝐴) = if(∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐴, 0, ( -1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴})))) | |
| 4 | 3 | eqeq1d 2762 | . . . . . 6 ⊢ (𝐴 ∈ ℕ → ((μ‘𝐴) = 0 ↔ if(∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐴, 0, ( -1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}))) = 0)) |
| 5 | 3 | eqeq1d 2762 | . . . . . 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 1569 ∈ wcel 2144 ≠ wne 2955 ∃wrex 3086 {crab 3412 ifcif 4481 class class class wbr 5102 ‘cfv 6543 (class class class)co 7424 0cc0 11207 1c1 11208 -cneg 11549 ℕcn 12342 2c2 12404 ↑cexp 14211 ♯chash 14481 ∥ cdvds 16431 ℙcprime 16855 μcmu 27431 |
| 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 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pr 5391 ax-1cn 11265 ax-icn 11266 ax-addcl 11267 ax-mulcl 11269 ax-i2m1 11275 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3897 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-iota 6497 df-fun 6545 df-fv 6551 df-ov 7427 df-mu 27437 |
| This theorem is used by: mumul 27517 musum 27527 |
| Copyright terms: Public domain | W3C validator |