Metamath Proof Explorer


Theorem chtvalz

Description: Value of the Chebyshev function for integers. (Contributed by Thierry Arnoux, 28-Dec-2021)

Ref Expression
Assertion chtvalz ⊢ N ∈ ℤ → θ ⁡ N = ∑ n ∈ 1 … N ∩ ℙ log ⁡ n

Proof

Step Hyp Ref Expression
1 zre ⊢ N ∈ ℤ → N ∈ ℝ
2 chtval ⊢ N ∈ ℝ → θ ⁡ N = ∑ n ∈ 0 N ∩ ℙ log ⁡ n
3 1 2 syl ⊢ N ∈ ℤ → θ ⁡ N = ∑ n ∈ 0 N ∩ ℙ log ⁡ n
4 nnz ⊢ N ∈ ℕ → N ∈ ℤ
5 ppisval ⊢ N ∈ ℝ → 0 N ∩ ℙ = 2 … N ∩ ℙ
6 1 5 syl ⊢ N ∈ ℤ → 0 N ∩ ℙ = 2 … N ∩ ℙ
7 flid ⊢ N ∈ ℤ → N = N
8 7 oveq2d ⊢ N ∈ ℤ → 2 … N = 2 … N
9 8 ineq1d ⊢ N ∈ ℤ → 2 … N ∩ ℙ = 2 … N ∩ ℙ
10 6 9 eqtrd ⊢ N ∈ ℤ → 0 N ∩ ℙ = 2 … N ∩ ℙ
11 4 10 syl ⊢ N ∈ ℕ → 0 N ∩ ℙ = 2 … N ∩ ℙ
12 2nn ⊢ 2 ∈ ℕ
13 nnuz ⊢ ℕ = ℤ ≥ 1
14 12 13 eleqtri ⊢ 2 ∈ ℤ ≥ 1
15 fzss1 ⊢ 2 ∈ ℤ ≥ 1 → 2 … N ⊆ 1 … N
16 14 15 ax-mp ⊢ 2 … N ⊆ 1 … N
17 ssdif0 ⊢ 2 … N ⊆ 1 … N ↔ 2 … N ∖ 1 … N = ∅
18 16 17 mpbi ⊢ 2 … N ∖ 1 … N = ∅
19 18 ineq1i ⊢ 2 … N ∖ 1 … N ∩ ℙ = ∅ ∩ ℙ
20 0in ⊢ ∅ ∩ ℙ = ∅
21 19 20 eqtri ⊢ 2 … N ∖ 1 … N ∩ ℙ = ∅
22 21 a1i ⊢ N ∈ ℕ → 2 … N ∖ 1 … N ∩ ℙ = ∅
23 13 eleq2i ⊢ N ∈ ℕ ↔ N ∈ ℤ ≥ 1
24 fzpred ⊢ N ∈ ℤ ≥ 1 → 1 … N = 1 ∪ 1 + 1 … N
25 23 24 sylbi ⊢ N ∈ ℕ → 1 … N = 1 ∪ 1 + 1 … N
26 25 eqcomd ⊢ N ∈ ℕ → 1 ∪ 1 + 1 … N = 1 … N
27 1p1e2 ⊢ 1 + 1 = 2
28 27 oveq1i ⊢ 1 + 1 … N = 2 … N
29 28 a1i ⊢ N ∈ ℕ → 1 + 1 … N = 2 … N
30 26 29 difeq12d ⊢ N ∈ ℕ → 1 ∪ 1 + 1 … N ∖ 1 + 1 … N = 1 … N ∖ 2 … N
31 difun2 ⊢ 1 ∪ 1 + 1 … N ∖ 1 + 1 … N = 1 ∖ 1 + 1 … N
32 fzpreddisj ⊢ N ∈ ℤ ≥ 1 → 1 ∩ 1 + 1 … N = ∅
33 23 32 sylbi ⊢ N ∈ ℕ → 1 ∩ 1 + 1 … N = ∅
34 disjdif2 ⊢ 1 ∩ 1 + 1 … N = ∅ → 1 ∖ 1 + 1 … N = 1
35 33 34 syl ⊢ N ∈ ℕ → 1 ∖ 1 + 1 … N = 1
36 31 35 eqtrid ⊢ N ∈ ℕ → 1 ∪ 1 + 1 … N ∖ 1 + 1 … N = 1
37 30 36 eqtr3d ⊢ N ∈ ℕ → 1 … N ∖ 2 … N = 1
38 37 ineq1d ⊢ N ∈ ℕ → 1 … N ∖ 2 … N ∩ ℙ = 1 ∩ ℙ
39 incom ⊢ ℙ ∩ 1 = 1 ∩ ℙ
40 1nprm ⊢ ¬ 1 ∈ ℙ
41 disjsn ⊢ ℙ ∩ 1 = ∅ ↔ ¬ 1 ∈ ℙ
42 40 41 mpbir ⊢ ℙ ∩ 1 = ∅
43 39 42 eqtr3i ⊢ 1 ∩ ℙ = ∅
44 38 43 eqtrdi ⊢ N ∈ ℕ → 1 … N ∖ 2 … N ∩ ℙ = ∅
45 difininv ⊢ 2 … N ∖ 1 … N ∩ ℙ = ∅ ∧ 1 … N ∖ 2 … N ∩ ℙ = ∅ → 2 … N ∩ ℙ = 1 … N ∩ ℙ
46 22 44 45 syl2anc ⊢ N ∈ ℕ → 2 … N ∩ ℙ = 1 … N ∩ ℙ
47 11 46 eqtrd ⊢ N ∈ ℕ → 0 N ∩ ℙ = 1 … N ∩ ℙ
48 47 adantl ⊢ N ∈ ℤ ∧ N ∈ ℕ → 0 N ∩ ℙ = 1 … N ∩ ℙ
49 znnnlt1 ⊢ N ∈ ℤ → ¬ N ∈ ℕ ↔ N < 1
50 49 biimpa ⊢ N ∈ ℤ ∧ ¬ N ∈ ℕ → N < 1
51 incom ⊢ 0 N ∩ ℙ = ℙ ∩ 0 N
52 isprm3 ⊢ n ∈ ℙ ↔ n ∈ ℤ ≥ 2 ∧ ∀ i ∈ 2 … n − 1 ¬ i ∥ n
53 52 simplbi ⊢ n ∈ ℙ → n ∈ ℤ ≥ 2
54 53 ssriv ⊢ ℙ ⊆ ℤ ≥ 2
55 12 nnzi ⊢ 2 ∈ ℤ
56 uzssico ⊢ 2 ∈ ℤ → ℤ ≥ 2 ⊆ 2 +∞
57 55 56 ax-mp ⊢ ℤ ≥ 2 ⊆ 2 +∞
58 54 57 sstri ⊢ ℙ ⊆ 2 +∞
59 incom ⊢ 0 N ∩ 2 +∞ = 2 +∞ ∩ 0 N
60 0xr ⊢ 0 ∈ ℝ *
61 60 a1i ⊢ N ∈ ℤ ∧ N < 1 → 0 ∈ ℝ *
62 12 nnrei ⊢ 2 ∈ ℝ
63 62 rexri ⊢ 2 ∈ ℝ *
64 63 a1i ⊢ N ∈ ℤ ∧ N < 1 → 2 ∈ ℝ *
65 0le0 ⊢ 0 ≤ 0
66 65 a1i ⊢ N ∈ ℤ ∧ N < 1 → 0 ≤ 0
67 1 adantr ⊢ N ∈ ℤ ∧ N < 1 → N ∈ ℝ
68 1red ⊢ N ∈ ℤ ∧ N < 1 → 1 ∈ ℝ
69 62 a1i ⊢ N ∈ ℤ ∧ N < 1 → 2 ∈ ℝ
70 simpr ⊢ N ∈ ℤ ∧ N < 1 → N < 1
71 1lt2 ⊢ 1 < 2
72 71 a1i ⊢ N ∈ ℤ ∧ N < 1 → 1 < 2
73 67 68 69 70 72 lttrd ⊢ N ∈ ℤ ∧ N < 1 → N < 2
74 iccssico ⊢ 0 ∈ ℝ * ∧ 2 ∈ ℝ * ∧ 0 ≤ 0 ∧ N < 2 → 0 N ⊆ 0 2
75 61 64 66 73 74 syl22anc ⊢ N ∈ ℤ ∧ N < 1 → 0 N ⊆ 0 2
76 pnfxr ⊢ +∞ ∈ ℝ *
77 icodisj ⊢ 0 ∈ ℝ * ∧ 2 ∈ ℝ * ∧ +∞ ∈ ℝ * → 0 2 ∩ 2 +∞ = ∅
78 60 63 76 77 mp3an ⊢ 0 2 ∩ 2 +∞ = ∅
79 ssdisj ⊢ 0 N ⊆ 0 2 ∧ 0 2 ∩ 2 +∞ = ∅ → 0 N ∩ 2 +∞ = ∅
80 75 78 79 sylancl ⊢ N ∈ ℤ ∧ N < 1 → 0 N ∩ 2 +∞ = ∅
81 59 80 eqtr3id ⊢ N ∈ ℤ ∧ N < 1 → 2 +∞ ∩ 0 N = ∅
82 ssdisj ⊢ ℙ ⊆ 2 +∞ ∧ 2 +∞ ∩ 0 N = ∅ → ℙ ∩ 0 N = ∅
83 58 81 82 sylancr ⊢ N ∈ ℤ ∧ N < 1 → ℙ ∩ 0 N = ∅
84 51 83 eqtrid ⊢ N ∈ ℤ ∧ N < 1 → 0 N ∩ ℙ = ∅
85 1zzd ⊢ N ∈ ℤ ∧ N < 1 → 1 ∈ ℤ
86 simpl ⊢ N ∈ ℤ ∧ N < 1 → N ∈ ℤ
87 fzn ⊢ 1 ∈ ℤ ∧ N ∈ ℤ → N < 1 ↔ 1 … N = ∅
88 87 biimpa ⊢ 1 ∈ ℤ ∧ N ∈ ℤ ∧ N < 1 → 1 … N = ∅
89 85 86 70 88 syl21anc ⊢ N ∈ ℤ ∧ N < 1 → 1 … N = ∅
90 89 ineq1d ⊢ N ∈ ℤ ∧ N < 1 → 1 … N ∩ ℙ = ∅ ∩ ℙ
91 90 20 eqtrdi ⊢ N ∈ ℤ ∧ N < 1 → 1 … N ∩ ℙ = ∅
92 84 91 eqtr4d ⊢ N ∈ ℤ ∧ N < 1 → 0 N ∩ ℙ = 1 … N ∩ ℙ
93 50 92 syldan ⊢ N ∈ ℤ ∧ ¬ N ∈ ℕ → 0 N ∩ ℙ = 1 … N ∩ ℙ
94 exmidd ⊢ N ∈ ℤ → N ∈ ℕ ∨ ¬ N ∈ ℕ
95 48 93 94 mpjaodan ⊢ N ∈ ℤ → 0 N ∩ ℙ = 1 … N ∩ ℙ
96 95 sumeq1d ⊢ N ∈ ℤ → ∑ n ∈ 0 N ∩ ℙ log ⁡ n = ∑ n ∈ 1 … N ∩ ℙ log ⁡ n
97 3 96 eqtrd ⊢ N ∈ ℤ → θ ⁡ N = ∑ n ∈ 1 … N ∩ ℙ log ⁡ n