![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > df-ppi | Structured version Visualization version GIF version |
Description: Define the prime π function, which counts the number of primes less than or equal to 𝑥, see definition in [ApostolNT] p. 8. (Contributed by Mario Carneiro, 15-Sep-2014.) |
Ref | Expression |
---|---|
df-ppi | ⊢ π = (𝑥 ∈ ℝ ↦ (♯‘((0[,]𝑥) ∩ ℙ))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cppi 25172 | . 2 class π | |
2 | vx | . . 3 setvar 𝑥 | |
3 | cr 10223 | . . 3 class ℝ | |
4 | cc0 10224 | . . . . . 6 class 0 | |
5 | 2 | cv 1652 | . . . . . 6 class 𝑥 |
6 | cicc 12427 | . . . . . 6 class [,] | |
7 | 4, 5, 6 | co 6878 | . . . . 5 class (0[,]𝑥) |
8 | cprime 15719 | . . . . 5 class ℙ | |
9 | 7, 8 | cin 3768 | . . . 4 class ((0[,]𝑥) ∩ ℙ) |
10 | chash 13370 | . . . 4 class ♯ | |
11 | 9, 10 | cfv 6101 | . . 3 class (♯‘((0[,]𝑥) ∩ ℙ)) |
12 | 2, 3, 11 | cmpt 4922 | . 2 class (𝑥 ∈ ℝ ↦ (♯‘((0[,]𝑥) ∩ ℙ))) |
13 | 1, 12 | wceq 1653 | 1 wff π = (𝑥 ∈ ℝ ↦ (♯‘((0[,]𝑥) ∩ ℙ))) |
Colors of variables: wff setvar class |
This definition is referenced by: ppival 25205 ppif 25208 |
Copyright terms: Public domain | W3C validator |