Metamath Proof Explorer


Theorem pcge0

Description: The prime count of an integer is greater than or equal to zero. (Contributed by Mario Carneiro, 3-Oct-2014)

Ref Expression
Assertion pcge0 ⊢ P ∈ ℙ ∧ N ∈ ℤ → 0 ≤ P pCnt N

Proof

Step Hyp Ref Expression
1 0lepnf ⊢ 0 ≤ +∞
2 oveq2 ⊢ N = 0 → P pCnt N = P pCnt 0
3 pc0 ⊢ P ∈ ℙ → P pCnt 0 = +∞
4 3 adantr ⊢ P ∈ ℙ ∧ N ∈ ℤ → P pCnt 0 = +∞
5 2 4 sylan9eqr ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ N = 0 → P pCnt N = +∞
6 1 5 breqtrrid ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ N = 0 → 0 ≤ P pCnt N
7 pczcl ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ N ≠ 0 → P pCnt N ∈ ℕ 0
8 7 nn0ge0d ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ N ≠ 0 → 0 ≤ P pCnt N
9 8 anassrs ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ N ≠ 0 → 0 ≤ P pCnt N
10 6 9 pm2.61dane ⊢ P ∈ ℙ ∧ N ∈ ℤ → 0 ≤ P pCnt N