Metamath Proof Explorer


Theorem prmorcht

Description: Relate the primorial (product of the primes up to A ) to the Chebyshev function. (Contributed by Mario Carneiro, 22-Sep-2014)

Ref Expression
Hypothesis prmorcht.1 ⊢ F = n ∈ ℕ ⟼ if n ∈ ℙ n 1
Assertion prmorcht ⊢ A ∈ ℕ → e θ ⁡ A = seq 1 × F ⁡ A

Proof

Step Hyp Ref Expression
1 prmorcht.1 ⊢ F = n ∈ ℕ ⟼ if n ∈ ℙ n 1
2 nnre ⊢ A ∈ ℕ → A ∈ ℝ
3 chtval ⊢ A ∈ ℝ → θ ⁡ A = ∑ k ∈ 0 A ∩ ℙ log ⁡ k
4 2 3 syl ⊢ A ∈ ℕ → θ ⁡ A = ∑ k ∈ 0 A ∩ ℙ log ⁡ k
5 2eluzge1 ⊢ 2 ∈ ℤ ≥ 1
6 ppisval2 ⊢ A ∈ ℝ ∧ 2 ∈ ℤ ≥ 1 → 0 A ∩ ℙ = 1 … A ∩ ℙ
7 2 5 6 sylancl ⊢ A ∈ ℕ → 0 A ∩ ℙ = 1 … A ∩ ℙ
8 nnz ⊢ A ∈ ℕ → A ∈ ℤ
9 flid ⊢ A ∈ ℤ → A = A
10 8 9 syl ⊢ A ∈ ℕ → A = A
11 10 oveq2d ⊢ A ∈ ℕ → 1 … A = 1 … A
12 11 ineq1d ⊢ A ∈ ℕ → 1 … A ∩ ℙ = 1 … A ∩ ℙ
13 7 12 eqtrd ⊢ A ∈ ℕ → 0 A ∩ ℙ = 1 … A ∩ ℙ
14 13 sumeq1d ⊢ A ∈ ℕ → ∑ k ∈ 0 A ∩ ℙ log ⁡ k = ∑ k ∈ 1 … A ∩ ℙ log ⁡ k
15 inss1 ⊢ 1 … A ∩ ℙ ⊆ 1 … A
16 elinel1 ⊢ k ∈ 1 … A ∩ ℙ → k ∈ 1 … A
17 elfznn ⊢ k ∈ 1 … A → k ∈ ℕ
18 17 adantl ⊢ A ∈ ℕ ∧ k ∈ 1 … A → k ∈ ℕ
19 18 nnrpd ⊢ A ∈ ℕ ∧ k ∈ 1 … A → k ∈ ℝ +
20 19 relogcld ⊢ A ∈ ℕ ∧ k ∈ 1 … A → log ⁡ k ∈ ℝ
21 20 recnd ⊢ A ∈ ℕ ∧ k ∈ 1 … A → log ⁡ k ∈ ℂ
22 16 21 sylan2 ⊢ A ∈ ℕ ∧ k ∈ 1 … A ∩ ℙ → log ⁡ k ∈ ℂ
23 22 ralrimiva ⊢ A ∈ ℕ → ∀ k ∈ 1 … A ∩ ℙ log ⁡ k ∈ ℂ
24 fzfi ⊢ 1 … A ∈ Fin
25 24 olci ⊢ 1 … A ⊆ ℤ ≥ 1 ∨ 1 … A ∈ Fin
26 sumss2 ⊢ 1 … A ∩ ℙ ⊆ 1 … A ∧ ∀ k ∈ 1 … A ∩ ℙ log ⁡ k ∈ ℂ ∧ 1 … A ⊆ ℤ ≥ 1 ∨ 1 … A ∈ Fin → ∑ k ∈ 1 … A ∩ ℙ log ⁡ k = ∑ k = 1 A if k ∈ 1 … A ∩ ℙ log ⁡ k 0
27 25 26 mpan2 ⊢ 1 … A ∩ ℙ ⊆ 1 … A ∧ ∀ k ∈ 1 … A ∩ ℙ log ⁡ k ∈ ℂ → ∑ k ∈ 1 … A ∩ ℙ log ⁡ k = ∑ k = 1 A if k ∈ 1 … A ∩ ℙ log ⁡ k 0
28 15 23 27 sylancr ⊢ A ∈ ℕ → ∑ k ∈ 1 … A ∩ ℙ log ⁡ k = ∑ k = 1 A if k ∈ 1 … A ∩ ℙ log ⁡ k 0
29 14 28 eqtrd ⊢ A ∈ ℕ → ∑ k ∈ 0 A ∩ ℙ log ⁡ k = ∑ k = 1 A if k ∈ 1 … A ∩ ℙ log ⁡ k 0
30 4 29 eqtrd ⊢ A ∈ ℕ → θ ⁡ A = ∑ k = 1 A if k ∈ 1 … A ∩ ℙ log ⁡ k 0
31 elin ⊢ k ∈ 1 … A ∩ ℙ ↔ k ∈ 1 … A ∧ k ∈ ℙ
32 31 baibr ⊢ k ∈ 1 … A → k ∈ ℙ ↔ k ∈ 1 … A ∩ ℙ
33 32 ifbid ⊢ k ∈ 1 … A → if k ∈ ℙ log ⁡ k 0 = if k ∈ 1 … A ∩ ℙ log ⁡ k 0
34 33 sumeq2i ⊢ ∑ k = 1 A if k ∈ ℙ log ⁡ k 0 = ∑ k = 1 A if k ∈ 1 … A ∩ ℙ log ⁡ k 0
35 30 34 eqtr4di ⊢ A ∈ ℕ → θ ⁡ A = ∑ k = 1 A if k ∈ ℙ log ⁡ k 0
36 eleq1w ⊢ n = k → n ∈ ℙ ↔ k ∈ ℙ
37 fveq2 ⊢ n = k → log ⁡ n = log ⁡ k
38 36 37 ifbieq1d ⊢ n = k → if n ∈ ℙ log ⁡ n 0 = if k ∈ ℙ log ⁡ k 0
39 eqid ⊢ n ∈ ℕ ⟼ if n ∈ ℙ log ⁡ n 0 = n ∈ ℕ ⟼ if n ∈ ℙ log ⁡ n 0
40 fvex ⊢ log ⁡ k ∈ V
41 0cn ⊢ 0 ∈ ℂ
42 41 elexi ⊢ 0 ∈ V
43 40 42 ifex ⊢ if k ∈ ℙ log ⁡ k 0 ∈ V
44 38 39 43 fvmpt ⊢ k ∈ ℕ → n ∈ ℕ ⟼ if n ∈ ℙ log ⁡ n 0 ⁡ k = if k ∈ ℙ log ⁡ k 0
45 18 44 syl ⊢ A ∈ ℕ ∧ k ∈ 1 … A → n ∈ ℕ ⟼ if n ∈ ℙ log ⁡ n 0 ⁡ k = if k ∈ ℙ log ⁡ k 0
46 elnnuz ⊢ A ∈ ℕ ↔ A ∈ ℤ ≥ 1
47 46 biimpi ⊢ A ∈ ℕ → A ∈ ℤ ≥ 1
48 ifcl ⊢ log ⁡ k ∈ ℂ ∧ 0 ∈ ℂ → if k ∈ ℙ log ⁡ k 0 ∈ ℂ
49 21 41 48 sylancl ⊢ A ∈ ℕ ∧ k ∈ 1 … A → if k ∈ ℙ log ⁡ k 0 ∈ ℂ
50 45 47 49 fsumser ⊢ A ∈ ℕ → ∑ k = 1 A if k ∈ ℙ log ⁡ k 0 = seq 1 + n ∈ ℕ ⟼ if n ∈ ℙ log ⁡ n 0 ⁡ A
51 35 50 eqtrd ⊢ A ∈ ℕ → θ ⁡ A = seq 1 + n ∈ ℕ ⟼ if n ∈ ℙ log ⁡ n 0 ⁡ A
52 51 fveq2d ⊢ A ∈ ℕ → e θ ⁡ A = e seq 1 + n ∈ ℕ ⟼ if n ∈ ℙ log ⁡ n 0 ⁡ A
53 addcl ⊢ k ∈ ℂ ∧ p ∈ ℂ → k + p ∈ ℂ
54 53 adantl ⊢ A ∈ ℕ ∧ k ∈ ℂ ∧ p ∈ ℂ → k + p ∈ ℂ
55 45 49 eqeltrd ⊢ A ∈ ℕ ∧ k ∈ 1 … A → n ∈ ℕ ⟼ if n ∈ ℙ log ⁡ n 0 ⁡ k ∈ ℂ
56 efadd ⊢ k ∈ ℂ ∧ p ∈ ℂ → e k + p = e k ⁢ e p
57 56 adantl ⊢ A ∈ ℕ ∧ k ∈ ℂ ∧ p ∈ ℂ → e k + p = e k ⁢ e p
58 1nn ⊢ 1 ∈ ℕ
59 ifcl ⊢ k ∈ ℕ ∧ 1 ∈ ℕ → if k ∈ ℙ k 1 ∈ ℕ
60 18 58 59 sylancl ⊢ A ∈ ℕ ∧ k ∈ 1 … A → if k ∈ ℙ k 1 ∈ ℕ
61 60 nnrpd ⊢ A ∈ ℕ ∧ k ∈ 1 … A → if k ∈ ℙ k 1 ∈ ℝ +
62 61 reeflogd ⊢ A ∈ ℕ ∧ k ∈ 1 … A → e log ⁡ if k ∈ ℙ k 1 = if k ∈ ℙ k 1
63 fvif ⊢ log ⁡ if k ∈ ℙ k 1 = if k ∈ ℙ log ⁡ k log ⁡ 1
64 log1 ⊢ log ⁡ 1 = 0
65 ifeq2 ⊢ log ⁡ 1 = 0 → if k ∈ ℙ log ⁡ k log ⁡ 1 = if k ∈ ℙ log ⁡ k 0
66 64 65 ax-mp ⊢ if k ∈ ℙ log ⁡ k log ⁡ 1 = if k ∈ ℙ log ⁡ k 0
67 63 66 eqtri ⊢ log ⁡ if k ∈ ℙ k 1 = if k ∈ ℙ log ⁡ k 0
68 45 67 eqtr4di ⊢ A ∈ ℕ ∧ k ∈ 1 … A → n ∈ ℕ ⟼ if n ∈ ℙ log ⁡ n 0 ⁡ k = log ⁡ if k ∈ ℙ k 1
69 68 fveq2d ⊢ A ∈ ℕ ∧ k ∈ 1 … A → e n ∈ ℕ ⟼ if n ∈ ℙ log ⁡ n 0 ⁡ k = e log ⁡ if k ∈ ℙ k 1
70 id ⊢ n = k → n = k
71 36 70 ifbieq1d ⊢ n = k → if n ∈ ℙ n 1 = if k ∈ ℙ k 1
72 vex ⊢ k ∈ V
73 58 elexi ⊢ 1 ∈ V
74 72 73 ifex ⊢ if k ∈ ℙ k 1 ∈ V
75 71 1 74 fvmpt ⊢ k ∈ ℕ → F ⁡ k = if k ∈ ℙ k 1
76 18 75 syl ⊢ A ∈ ℕ ∧ k ∈ 1 … A → F ⁡ k = if k ∈ ℙ k 1
77 62 69 76 3eqtr4d ⊢ A ∈ ℕ ∧ k ∈ 1 … A → e n ∈ ℕ ⟼ if n ∈ ℙ log ⁡ n 0 ⁡ k = F ⁡ k
78 54 55 47 57 77 seqhomo ⊢ A ∈ ℕ → e seq 1 + n ∈ ℕ ⟼ if n ∈ ℙ log ⁡ n 0 ⁡ A = seq 1 × F ⁡ A
79 52 78 eqtrd ⊢ A ∈ ℕ → e θ ⁡ A = seq 1 × F ⁡ A