| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > muval | Structured version Visualization version GIF version | ||
| Description: The value of the Möbius function. (Contributed by Mario Carneiro, 22-Sep-2014.) |
| Ref | Expression |
|---|---|
| muval | ⊢ (𝐴 ∈ ℕ → (μ‘𝐴) = if(∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐴, 0, (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴})))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | breq2 5112 | . . . 4 ⊢ (𝑥 = 𝐴 → ((𝑝↑2) ∥ 𝑥 ↔ (𝑝↑2) ∥ 𝐴)) | |
| 2 | 1 | rexbidv 3188 | . . 3 ⊢ (𝑥 = 𝐴 → (∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝑥 ↔ ∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐴)) |
| 3 | breq2 5112 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑝 ∥ 𝑥 ↔ 𝑝 ∥ 𝐴)) | |
| 4 | 3 | rabbidv 3422 | . . . . 5 ⊢ (𝑥 = 𝐴 → {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝑥} = {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}) |
| 5 | 4 | fveq2d 6885 | . . . 4 ⊢ (𝑥 = 𝐴 → (♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝑥}) = (♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴})) |
| 6 | 5 | oveq2d 7428 | . . 3 ⊢ (𝑥 = 𝐴 → (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝑥})) = (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}))) |
| 7 | 2, 6 | ifbieq2d 4513 | . 2 ⊢ (𝑥 = 𝐴 → if(∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝑥, 0, (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝑥}))) = if(∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐴, 0, (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴})))) |
| 8 | df-mu 27276 | . 2 ⊢ μ = (𝑥 ∈ ℕ ↦ if(∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝑥, 0, (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝑥})))) | |
| 9 | c0ex 11206 | . . 3 ⊢ 0 ∈ V | |
| 10 | ovex 7445 | . . 3 ⊢ (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴})) ∈ V | |
| 11 | 9, 10 | ifex 4537 | . 2 ⊢ if(∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐴, 0, (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}))) ∈ V |
| 12 | 7, 8, 11 | fvmpt 6989 | 1 ⊢ (𝐴 ∈ ℕ → (μ‘𝐴) = if(∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐴, 0, (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴})))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 ∈ wcel 2142 ∃wrex 3088 {crab 3415 ifcif 4486 class class class wbr 5108 ‘cfv 6536 (class class class)co 7412 0cc0 11106 1c1 11107 -cneg 11448 ℕcn 12239 2c2 12301 ↑cexp 14104 ♯chash 14373 ∥ cdvds 16316 ℙcprime 16735 μcmu 27270 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5256 ax-nul 5268 ax-pr 5403 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-mulcl 11168 ax-i2m1 11174 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3416 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-br 5109 df-opab 5173 df-mpt 5192 df-id 5555 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-iota 6492 df-fun 6538 df-fv 6544 df-ov 7415 df-mu 27276 |
| This theorem is used by: muval1 27308 muval2 27309 isnsqf 27310 mule1 27323 |
| Copyright terms: Public domain | W3C validator |