Metamath Proof Explorer


Theorem chtlepsi

Description: The first Chebyshev function is less than the second. (Contributed by Mario Carneiro, 7-Apr-2016)

Ref Expression
Assertion chtlepsi ⊢ A ∈ ℝ → θ ⁡ A ≤ ψ ⁡ A

Proof

Step Hyp Ref Expression
1 fzfid ⊢ A ∈ ℝ → 1 … A ∈ Fin
2 elfznn ⊢ n ∈ 1 … A → n ∈ ℕ
3 2 adantl ⊢ A ∈ ℝ ∧ n ∈ 1 … A → n ∈ ℕ
4 vmacl ⊢ n ∈ ℕ → Λ ⁡ n ∈ ℝ
5 3 4 syl ⊢ A ∈ ℝ ∧ n ∈ 1 … A → Λ ⁡ n ∈ ℝ
6 vmage0 ⊢ n ∈ ℕ → 0 ≤ Λ ⁡ n
7 3 6 syl ⊢ A ∈ ℝ ∧ n ∈ 1 … A → 0 ≤ Λ ⁡ n
8 ppisval ⊢ A ∈ ℝ → 0 A ∩ ℙ = 2 … A ∩ ℙ
9 inss1 ⊢ 2 … A ∩ ℙ ⊆ 2 … A
10 2eluzge1 ⊢ 2 ∈ ℤ ≥ 1
11 fzss1 ⊢ 2 ∈ ℤ ≥ 1 → 2 … A ⊆ 1 … A
12 10 11 mp1i ⊢ A ∈ ℝ → 2 … A ⊆ 1 … A
13 9 12 sstrid ⊢ A ∈ ℝ → 2 … A ∩ ℙ ⊆ 1 … A
14 8 13 eqsstrd ⊢ A ∈ ℝ → 0 A ∩ ℙ ⊆ 1 … A
15 1 5 7 14 fsumless ⊢ A ∈ ℝ → ∑ n ∈ 0 A ∩ ℙ Λ ⁡ n ≤ ∑ n = 1 A Λ ⁡ n
16 chtval ⊢ A ∈ ℝ → θ ⁡ A = ∑ n ∈ 0 A ∩ ℙ log ⁡ n
17 simpr ⊢ A ∈ ℝ ∧ n ∈ 0 A ∩ ℙ → n ∈ 0 A ∩ ℙ
18 17 elin2d ⊢ A ∈ ℝ ∧ n ∈ 0 A ∩ ℙ → n ∈ ℙ
19 vmaprm ⊢ n ∈ ℙ → Λ ⁡ n = log ⁡ n
20 18 19 syl ⊢ A ∈ ℝ ∧ n ∈ 0 A ∩ ℙ → Λ ⁡ n = log ⁡ n
21 20 sumeq2dv ⊢ A ∈ ℝ → ∑ n ∈ 0 A ∩ ℙ Λ ⁡ n = ∑ n ∈ 0 A ∩ ℙ log ⁡ n
22 16 21 eqtr4d ⊢ A ∈ ℝ → θ ⁡ A = ∑ n ∈ 0 A ∩ ℙ Λ ⁡ n
23 chpval ⊢ A ∈ ℝ → ψ ⁡ A = ∑ n = 1 A Λ ⁡ n
24 15 22 23 3brtr4d ⊢ A ∈ ℝ → θ ⁡ A ≤ ψ ⁡ A