| 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 5111 | . . . 4 ⊢ (𝑥 = 𝐴 → ((𝑝↑2) ∥ 𝑥 ↔ (𝑝↑2) ∥ 𝐴)) | |
| 2 | 1 | rexbidv 3157 | . . 3 ⊢ (𝑥 = 𝐴 → (∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝑥 ↔ ∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐴)) |
| 3 | breq2 5111 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑝 ∥ 𝑥 ↔ 𝑝 ∥ 𝐴)) | |
| 4 | 3 | rabbidv 3413 | . . . . 5 ⊢ (𝑥 = 𝐴 → {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝑥} = {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}) |
| 5 | 4 | fveq2d 6862 | . . . 4 ⊢ (𝑥 = 𝐴 → (♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝑥}) = (♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴})) |
| 6 | 5 | oveq2d 7403 | . . 3 ⊢ (𝑥 = 𝐴 → (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝑥})) = (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}))) |
| 7 | 2, 6 | ifbieq2d 4515 | . 2 ⊢ (𝑥 = 𝐴 → if(∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝑥, 0, (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝑥}))) = if(∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐴, 0, (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴})))) |
| 8 | df-mu 27011 | . 2 ⊢ μ = (𝑥 ∈ ℕ ↦ if(∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝑥, 0, (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝑥})))) | |
| 9 | c0ex 11168 | . . 3 ⊢ 0 ∈ V | |
| 10 | ovex 7420 | . . 3 ⊢ (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴})) ∈ V | |
| 11 | 9, 10 | ifex 4539 | . 2 ⊢ if(∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐴, 0, (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}))) ∈ V |
| 12 | 7, 8, 11 | fvmpt 6968 | 1 ⊢ (𝐴 ∈ ℕ → (μ‘𝐴) = if(∃𝑝 ∈ ℙ (𝑝↑2) ∥ 𝐴, 0, (-1↑(♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴})))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1540 ∈ wcel 2109 ∃wrex 3053 {crab 3405 ifcif 4488 class class class wbr 5107 ‘cfv 6511 (class class class)co 7387 0cc0 11068 1c1 11069 -cneg 11406 ℕcn 12186 2c2 12241 ↑cexp 14026 ♯chash 14295 ∥ cdvds 16222 ℙcprime 16641 μcmu 27005 |
| 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 5251 ax-nul 5261 ax-pr 5387 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-mulcl 11130 ax-i2m1 11136 |
| 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 3406 df-v 3449 df-dif 3917 df-un 3919 df-ss 3931 df-nul 4297 df-if 4489 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-br 5108 df-opab 5170 df-mpt 5189 df-id 5533 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-iota 6464 df-fun 6513 df-fv 6519 df-ov 7390 df-mu 27011 |
| This theorem is referenced by: muval1 27043 muval2 27044 isnsqf 27045 mule1 27058 |
| Copyright terms: Public domain | W3C validator |