| 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 5099 | . . . 4 ⊢ (𝑥 = 𝐴 → ((𝑝↑2) ∥ 𝑥 ↔ (𝑝↑2) ∥ 𝐴)) | |
| 2 | 1 | rexbidv 3153 | . . 3 ⊢ (𝑥 = 𝐴 → (∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝑥 ↔ ∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐴)) |
| 3 | breq2 5099 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑝 ∥ 𝑥 ↔ 𝑝 ∥ 𝐴)) | |
| 4 | 3 | rabbidv 3404 | . . . . 5 ⊢ (𝑥 = 𝐴 → {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝑥} = {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}) |
| 5 | 4 | fveq2d 6830 | . . . 4 ⊢ (𝑥 = 𝐴 → (♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝑥}) = (♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴})) |
| 6 | 5 | oveq2d 7369 | . . 3 ⊢ (𝑥 = 𝐴 → (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝑥})) = (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}))) |
| 7 | 2, 6 | ifbieq2d 4505 | . 2 ⊢ (𝑥 = 𝐴 → if(∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝑥, 0, (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝑥}))) = if(∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐴, 0, (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴})))) |
| 8 | df-mu 27027 | . 2 ⊢ μ = (𝑥 ∈ ℕ ↦ if(∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝑥, 0, (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝑥})))) | |
| 9 | c0ex 11128 | . . 3 ⊢ 0 ∈ V | |
| 10 | ovex 7386 | . . 3 ⊢ (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴})) ∈ V | |
| 11 | 9, 10 | ifex 4529 | . 2 ⊢ if(∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐴, 0, (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}))) ∈ V |
| 12 | 7, 8, 11 | fvmpt 6934 | 1 ⊢ (𝐴 ∈ ℕ → (μ‘𝐴) = if(∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐴, 0, (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴})))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1540 ∈ wcel 2109 ∃wrex 3053 {crab 3396 ifcif 4478 class class class wbr 5095 ‘cfv 6486 (class class class)co 7353 0cc0 11028 1c1 11029 -cneg 11366 ℕcn 12146 2c2 12201 ↑cexp 13986 ♯chash 14255 ∥ cdvds 16181 ℙcprime 16600 μcmu 27021 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5238 ax-nul 5248 ax-pr 5374 ax-1cn 11086 ax-icn 11087 ax-addcl 11088 ax-mulcl 11090 ax-i2m1 11096 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-rab 3397 df-v 3440 df-dif 3908 df-un 3910 df-ss 3922 df-nul 4287 df-if 4479 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4862 df-br 5096 df-opab 5158 df-mpt 5177 df-id 5518 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-iota 6442 df-fun 6488 df-fv 6494 df-ov 7356 df-mu 27027 |
| This theorem is referenced by: muval1 27059 muval2 27060 isnsqf 27061 mule1 27074 |
| Copyright terms: Public domain | W3C validator |