Metamath Proof Explorer


Theorem pcxcl

Description: Extended real closure of the general prime count function. (Contributed by Mario Carneiro, 3-Oct-2014)

Ref Expression
Assertion pcxcl ⊢ P ∈ ℙ ∧ N ∈ ℚ → P pCnt N ∈ ℝ *

Proof

Step Hyp Ref Expression
1 pc0 ⊢ P ∈ ℙ → P pCnt 0 = +∞
2 pnfxr ⊢ +∞ ∈ ℝ *
3 1 2 eqeltrdi ⊢ P ∈ ℙ → P pCnt 0 ∈ ℝ *
4 3 adantr ⊢ P ∈ ℙ ∧ N ∈ ℚ → P pCnt 0 ∈ ℝ *
5 oveq2 ⊢ N = 0 → P pCnt N = P pCnt 0
6 5 eleq1d ⊢ N = 0 → P pCnt N ∈ ℝ * ↔ P pCnt 0 ∈ ℝ *
7 4 6 syl5ibrcom ⊢ P ∈ ℙ ∧ N ∈ ℚ → N = 0 → P pCnt N ∈ ℝ *
8 pcqcl ⊢ P ∈ ℙ ∧ N ∈ ℚ ∧ N ≠ 0 → P pCnt N ∈ ℤ
9 8 zred ⊢ P ∈ ℙ ∧ N ∈ ℚ ∧ N ≠ 0 → P pCnt N ∈ ℝ
10 9 rexrd ⊢ P ∈ ℙ ∧ N ∈ ℚ ∧ N ≠ 0 → P pCnt N ∈ ℝ *
11 10 expr ⊢ P ∈ ℙ ∧ N ∈ ℚ → N ≠ 0 → P pCnt N ∈ ℝ *
12 7 11 pm2.61dne ⊢ P ∈ ℙ ∧ N ∈ ℚ → P pCnt N ∈ ℝ *