| 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 5102 | . . . 4 ⊢ (𝑥 = 𝐴 → ((𝑝↑2) ∥ 𝑥 ↔ (𝑝↑2) ∥ 𝐴)) | |
| 2 | 1 | rexbidv 3160 | . . 3 ⊢ (𝑥 = 𝐴 → (∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝑥 ↔ ∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐴)) |
| 3 | breq2 5102 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑝 ∥ 𝑥 ↔ 𝑝 ∥ 𝐴)) | |
| 4 | 3 | rabbidv 3406 | . . . . 5 ⊢ (𝑥 = 𝐴 → {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝑥} = {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}) |
| 5 | 4 | fveq2d 6838 | . . . 4 ⊢ (𝑥 = 𝐴 → (♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝑥}) = (♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴})) |
| 6 | 5 | oveq2d 7374 | . . 3 ⊢ (𝑥 = 𝐴 → (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝑥})) = (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}))) |
| 7 | 2, 6 | ifbieq2d 4506 | . 2 ⊢ (𝑥 = 𝐴 → if(∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝑥, 0, (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝑥}))) = if(∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐴, 0, (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴})))) |
| 8 | df-mu 27067 | . 2 ⊢ μ = (𝑥 ∈ ℕ ↦ if(∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝑥, 0, (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝑥})))) | |
| 9 | c0ex 11126 | . . 3 ⊢ 0 ∈ V | |
| 10 | ovex 7391 | . . 3 ⊢ (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴})) ∈ V | |
| 11 | 9, 10 | ifex 4530 | . 2 ⊢ if(∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐴, 0, (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}))) ∈ V |
| 12 | 7, 8, 11 | fvmpt 6941 | 1 ⊢ (𝐴 ∈ ℕ → (μ‘𝐴) = if(∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐴, 0, (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴})))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2113 ∃wrex 3060 {crab 3399 ifcif 4479 class class class wbr 5098 ‘cfv 6492 (class class class)co 7358 0cc0 11026 1c1 11027 -cneg 11365 ℕcn 12145 2c2 12200 ↑cexp 13984 ♯chash 14253 ∥ cdvds 16179 ℙcprime 16598 μcmu 27061 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pr 5377 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-mulcl 11088 ax-i2m1 11094 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-dif 3904 df-un 3906 df-ss 3918 df-nul 4286 df-if 4480 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-iota 6448 df-fun 6494 df-fv 6500 df-ov 7361 df-mu 27067 |
| This theorem is referenced by: muval1 27099 muval2 27100 isnsqf 27101 mule1 27114 |
| Copyright terms: Public domain | W3C validator |