| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > vmaval | Structured version Visualization version GIF version | ||
| Description: Value of the von Mangoldt function. (Contributed by Mario Carneiro, 7-Apr-2016.) |
| Ref | Expression |
|---|---|
| vmaval.1 | ⊢ 𝑆 = {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} |
| Ref | Expression |
|---|---|
| vmaval | ⊢ (𝐴 ∈ ℕ → (Λ‘𝐴) = if((♯‘𝑆) = 1, (log‘∪ 𝑆), 0)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | prmex 16725 | . . . . 5 ⊢ ℙ ∈ V | |
| 2 | 1 | rabex 5300 | . . . 4 ⊢ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝑥} ∈ V |
| 3 | 2 | a1i 11 | . . 3 ⊢ (𝑥 = 𝐴 → {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝑥} ∈ V) |
| 4 | id 23 | . . . . . 6 ⊢ (𝑠 = {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝑥} → 𝑠 = {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝑥}) | |
| 5 | breq2 5109 | . . . . . . . 8 ⊢ (𝑥 = 𝐴 → (𝑝 ∥ 𝑥 ↔ 𝑝 ∥ 𝐴)) | |
| 6 | 5 | rabbidv 3424 | . . . . . . 7 ⊢ (𝑥 = 𝐴 → {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝑥} = {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}) |
| 7 | vmaval.1 | . . . . . . 7 ⊢ 𝑆 = {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} | |
| 8 | 6, 7 | eqtr4di 2818 | . . . . . 6 ⊢ (𝑥 = 𝐴 → {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝑥} = 𝑆) |
| 9 | 4, 8 | sylan9eqr 2822 | . . . . 5 ⊢ ((𝑥 = 𝐴 ∧ 𝑠 = {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝑥}) → 𝑠 = 𝑆) |
| 10 | 9 | fveqeq2d 6879 | . . . 4 ⊢ ((𝑥 = 𝐴 ∧ 𝑠 = {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝑥}) → ((♯‘𝑠) = 1 ↔ (♯‘𝑆) = 1)) |
| 11 | 9 | unieqd 4881 | . . . . 5 ⊢ ((𝑥 = 𝐴 ∧ 𝑠 = {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝑥}) → ∪ 𝑠 = ∪ 𝑆) |
| 12 | 11 | fveq2d 6875 | . . . 4 ⊢ ((𝑥 = 𝐴 ∧ 𝑠 = {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝑥}) → (log‘∪ 𝑠) = (log‘∪ 𝑆)) |
| 13 | 10, 12 | ifbieq1d 4508 | . . 3 ⊢ ((𝑥 = 𝐴 ∧ 𝑠 = {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝑥}) → if((♯‘𝑠) = 1, (log‘∪ 𝑠), 0) = if((♯‘𝑆) = 1, (log‘∪ 𝑆), 0)) |
| 14 | 3, 13 | csbied 3891 | . 2 ⊢ (𝑥 = 𝐴 → ⦋{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝑥} / 𝑠⦌if((♯‘𝑠) = 1, (log‘∪ 𝑠), 0) = if((♯‘𝑆) = 1, (log‘∪ 𝑆), 0)) |
| 15 | df-vma 27220 | . 2 ⊢ Λ = (𝑥 ∈ ℕ ↦ ⦋{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝑥} / 𝑠⦌if((♯‘𝑠) = 1, (log‘∪ 𝑠), 0)) | |
| 16 | fvex 6884 | . . 3 ⊢ (log‘∪ 𝑆) ∈ V | |
| 17 | c0ex 11188 | . . 3 ⊢ 0 ∈ V | |
| 18 | 16, 17 | ifex 4534 | . 2 ⊢ if((♯‘𝑆) = 1, (log‘∪ 𝑆), 0) ∈ V |
| 19 | 14, 15, 18 | fvmpt 6979 | 1 ⊢ (𝐴 ∈ ℕ → (Λ‘𝐴) = if((♯‘𝑆) = 1, (log‘∪ 𝑆), 0)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1563 ∈ wcel 2145 {crab 3417 Vcvv 3457 ⦋csb 3855 ifcif 4483 ∪ cuni 4868 class class class wbr 5105 ‘cfv 6525 0cc0 11088 1c1 11089 ℕcn 12224 ♯chash 14357 ∥ cdvds 16300 ℙcprime 16719 logclog 26677 Λcvma 27214 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5251 ax-nul 5261 ax-pr 5395 ax-un 7722 ax-cnex 11144 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-mulcl 11150 ax-i2m1 11156 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3080 df-rex 3090 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-iun 4954 df-br 5106 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5547 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-we 5607 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-pred 6292 df-ord 6353 df-on 6354 df-lim 6355 df-suc 6356 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-ov 7403 df-om 7851 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-nn 12225 df-prm 16720 df-vma 27220 |
| This theorem is referenced by: isppw 27236 vmappw 27238 |
| Copyright terms: Public domain | W3C validator |