Metamath Proof Explorer


Theorem vmasum

Description: The sum of the von Mangoldt function over the divisors of n . Equation 9.2.4 of Shapiro, p. 328 and theorem 2.10 in ApostolNT p. 32. (Contributed by Mario Carneiro, 15-Apr-2016)

Ref Expression
Assertion vmasum ⊢ A ∈ ℕ → ∑ n ∈ x ∈ ℕ | x ∥ A Λ ⁡ n = log ⁡ A

Proof

Step Hyp Ref Expression
1 fveq2 ⊢ n = p k → Λ ⁡ n = Λ ⁡ p k
2 dvdsfi ⊢ A ∈ ℕ → x ∈ ℕ | x ∥ A ∈ Fin
3 ssrab2 ⊢ x ∈ ℕ | x ∥ A ⊆ ℕ
4 3 a1i ⊢ A ∈ ℕ → x ∈ ℕ | x ∥ A ⊆ ℕ
5 fzfid ⊢ A ∈ ℕ → 1 … A ∈ Fin
6 inss1 ⊢ 1 … A ∩ ℙ ⊆ 1 … A
7 ssfi ⊢ 1 … A ∈ Fin ∧ 1 … A ∩ ℙ ⊆ 1 … A → 1 … A ∩ ℙ ∈ Fin
8 5 6 7 sylancl ⊢ A ∈ ℕ → 1 … A ∩ ℙ ∈ Fin
9 pccl ⊢ p ∈ ℙ ∧ A ∈ ℕ → p pCnt A ∈ ℕ 0
10 9 ancoms ⊢ A ∈ ℕ ∧ p ∈ ℙ → p pCnt A ∈ ℕ 0
11 10 nn0zd ⊢ A ∈ ℕ ∧ p ∈ ℙ → p pCnt A ∈ ℤ
12 fznn ⊢ p pCnt A ∈ ℤ → k ∈ 1 … p pCnt A ↔ k ∈ ℕ ∧ k ≤ p pCnt A
13 11 12 syl ⊢ A ∈ ℕ ∧ p ∈ ℙ → k ∈ 1 … p pCnt A ↔ k ∈ ℕ ∧ k ≤ p pCnt A
14 13 anbi2d ⊢ A ∈ ℕ ∧ p ∈ ℙ → p ∈ 1 … A ∧ k ∈ 1 … p pCnt A ↔ p ∈ 1 … A ∧ k ∈ ℕ ∧ k ≤ p pCnt A
15 an12 ⊢ p ∈ 1 … A ∧ k ∈ ℕ ∧ k ≤ p pCnt A ↔ k ∈ ℕ ∧ p ∈ 1 … A ∧ k ≤ p pCnt A
16 prmz ⊢ p ∈ ℙ → p ∈ ℤ
17 16 adantl ⊢ A ∈ ℕ ∧ p ∈ ℙ → p ∈ ℤ
18 iddvdsexp ⊢ p ∈ ℤ ∧ k ∈ ℕ → p ∥ p k
19 17 18 sylan ⊢ A ∈ ℕ ∧ p ∈ ℙ ∧ k ∈ ℕ → p ∥ p k
20 16 ad2antlr ⊢ A ∈ ℕ ∧ p ∈ ℙ ∧ k ∈ ℕ → p ∈ ℤ
21 prmnn ⊢ p ∈ ℙ → p ∈ ℕ
22 21 adantl ⊢ A ∈ ℕ ∧ p ∈ ℙ → p ∈ ℕ
23 nnnn0 ⊢ k ∈ ℕ → k ∈ ℕ 0
24 nnexpcl ⊢ p ∈ ℕ ∧ k ∈ ℕ 0 → p k ∈ ℕ
25 22 23 24 syl2an ⊢ A ∈ ℕ ∧ p ∈ ℙ ∧ k ∈ ℕ → p k ∈ ℕ
26 25 nnzd ⊢ A ∈ ℕ ∧ p ∈ ℙ ∧ k ∈ ℕ → p k ∈ ℤ
27 nnz ⊢ A ∈ ℕ → A ∈ ℤ
28 27 ad2antrr ⊢ A ∈ ℕ ∧ p ∈ ℙ ∧ k ∈ ℕ → A ∈ ℤ
29 dvdstr ⊢ p ∈ ℤ ∧ p k ∈ ℤ ∧ A ∈ ℤ → p ∥ p k ∧ p k ∥ A → p ∥ A
30 20 26 28 29 syl3anc ⊢ A ∈ ℕ ∧ p ∈ ℙ ∧ k ∈ ℕ → p ∥ p k ∧ p k ∥ A → p ∥ A
31 19 30 mpand ⊢ A ∈ ℕ ∧ p ∈ ℙ ∧ k ∈ ℕ → p k ∥ A → p ∥ A
32 simpll ⊢ A ∈ ℕ ∧ p ∈ ℙ ∧ k ∈ ℕ → A ∈ ℕ
33 dvdsle ⊢ p ∈ ℤ ∧ A ∈ ℕ → p ∥ A → p ≤ A
34 20 32 33 syl2anc ⊢ A ∈ ℕ ∧ p ∈ ℙ ∧ k ∈ ℕ → p ∥ A → p ≤ A
35 31 34 syld ⊢ A ∈ ℕ ∧ p ∈ ℙ ∧ k ∈ ℕ → p k ∥ A → p ≤ A
36 21 ad2antlr ⊢ A ∈ ℕ ∧ p ∈ ℙ ∧ k ∈ ℕ → p ∈ ℕ
37 fznn ⊢ A ∈ ℤ → p ∈ 1 … A ↔ p ∈ ℕ ∧ p ≤ A
38 37 baibd ⊢ A ∈ ℤ ∧ p ∈ ℕ → p ∈ 1 … A ↔ p ≤ A
39 28 36 38 syl2anc ⊢ A ∈ ℕ ∧ p ∈ ℙ ∧ k ∈ ℕ → p ∈ 1 … A ↔ p ≤ A
40 35 39 sylibrd ⊢ A ∈ ℕ ∧ p ∈ ℙ ∧ k ∈ ℕ → p k ∥ A → p ∈ 1 … A
41 40 pm4.71rd ⊢ A ∈ ℕ ∧ p ∈ ℙ ∧ k ∈ ℕ → p k ∥ A ↔ p ∈ 1 … A ∧ p k ∥ A
42 breq1 ⊢ x = p k → x ∥ A ↔ p k ∥ A
43 42 elrab3 ⊢ p k ∈ ℕ → p k ∈ x ∈ ℕ | x ∥ A ↔ p k ∥ A
44 25 43 syl ⊢ A ∈ ℕ ∧ p ∈ ℙ ∧ k ∈ ℕ → p k ∈ x ∈ ℕ | x ∥ A ↔ p k ∥ A
45 simplr ⊢ A ∈ ℕ ∧ p ∈ ℙ ∧ k ∈ ℕ → p ∈ ℙ
46 23 adantl ⊢ A ∈ ℕ ∧ p ∈ ℙ ∧ k ∈ ℕ → k ∈ ℕ 0
47 pcdvdsb ⊢ p ∈ ℙ ∧ A ∈ ℤ ∧ k ∈ ℕ 0 → k ≤ p pCnt A ↔ p k ∥ A
48 45 28 46 47 syl3anc ⊢ A ∈ ℕ ∧ p ∈ ℙ ∧ k ∈ ℕ → k ≤ p pCnt A ↔ p k ∥ A
49 48 anbi2d ⊢ A ∈ ℕ ∧ p ∈ ℙ ∧ k ∈ ℕ → p ∈ 1 … A ∧ k ≤ p pCnt A ↔ p ∈ 1 … A ∧ p k ∥ A
50 41 44 49 3bitr4rd ⊢ A ∈ ℕ ∧ p ∈ ℙ ∧ k ∈ ℕ → p ∈ 1 … A ∧ k ≤ p pCnt A ↔ p k ∈ x ∈ ℕ | x ∥ A
51 50 pm5.32da ⊢ A ∈ ℕ ∧ p ∈ ℙ → k ∈ ℕ ∧ p ∈ 1 … A ∧ k ≤ p pCnt A ↔ k ∈ ℕ ∧ p k ∈ x ∈ ℕ | x ∥ A
52 15 51 bitrid ⊢ A ∈ ℕ ∧ p ∈ ℙ → p ∈ 1 … A ∧ k ∈ ℕ ∧ k ≤ p pCnt A ↔ k ∈ ℕ ∧ p k ∈ x ∈ ℕ | x ∥ A
53 14 52 bitrd ⊢ A ∈ ℕ ∧ p ∈ ℙ → p ∈ 1 … A ∧ k ∈ 1 … p pCnt A ↔ k ∈ ℕ ∧ p k ∈ x ∈ ℕ | x ∥ A
54 53 pm5.32da ⊢ A ∈ ℕ → p ∈ ℙ ∧ p ∈ 1 … A ∧ k ∈ 1 … p pCnt A ↔ p ∈ ℙ ∧ k ∈ ℕ ∧ p k ∈ x ∈ ℕ | x ∥ A
55 elin ⊢ p ∈ 1 … A ∩ ℙ ↔ p ∈ 1 … A ∧ p ∈ ℙ
56 55 anbi1i ⊢ p ∈ 1 … A ∩ ℙ ∧ k ∈ 1 … p pCnt A ↔ p ∈ 1 … A ∧ p ∈ ℙ ∧ k ∈ 1 … p pCnt A
57 anass ⊢ p ∈ 1 … A ∧ p ∈ ℙ ∧ k ∈ 1 … p pCnt A ↔ p ∈ 1 … A ∧ p ∈ ℙ ∧ k ∈ 1 … p pCnt A
58 an12 ⊢ p ∈ 1 … A ∧ p ∈ ℙ ∧ k ∈ 1 … p pCnt A ↔ p ∈ ℙ ∧ p ∈ 1 … A ∧ k ∈ 1 … p pCnt A
59 56 57 58 3bitri ⊢ p ∈ 1 … A ∩ ℙ ∧ k ∈ 1 … p pCnt A ↔ p ∈ ℙ ∧ p ∈ 1 … A ∧ k ∈ 1 … p pCnt A
60 anass ⊢ p ∈ ℙ ∧ k ∈ ℕ ∧ p k ∈ x ∈ ℕ | x ∥ A ↔ p ∈ ℙ ∧ k ∈ ℕ ∧ p k ∈ x ∈ ℕ | x ∥ A
61 54 59 60 3bitr4g ⊢ A ∈ ℕ → p ∈ 1 … A ∩ ℙ ∧ k ∈ 1 … p pCnt A ↔ p ∈ ℙ ∧ k ∈ ℕ ∧ p k ∈ x ∈ ℕ | x ∥ A
62 4 sselda ⊢ A ∈ ℕ ∧ n ∈ x ∈ ℕ | x ∥ A → n ∈ ℕ
63 vmacl ⊢ n ∈ ℕ → Λ ⁡ n ∈ ℝ
64 62 63 syl ⊢ A ∈ ℕ ∧ n ∈ x ∈ ℕ | x ∥ A → Λ ⁡ n ∈ ℝ
65 64 recnd ⊢ A ∈ ℕ ∧ n ∈ x ∈ ℕ | x ∥ A → Λ ⁡ n ∈ ℂ
66 simprr ⊢ A ∈ ℕ ∧ n ∈ x ∈ ℕ | x ∥ A ∧ Λ ⁡ n = 0 → Λ ⁡ n = 0
67 1 2 4 8 61 65 66 fsumvma ⊢ A ∈ ℕ → ∑ n ∈ x ∈ ℕ | x ∥ A Λ ⁡ n = ∑ p ∈ 1 … A ∩ ℙ ∑ k = 1 p pCnt A Λ ⁡ p k
68 elinel2 ⊢ p ∈ 1 … A ∩ ℙ → p ∈ ℙ
69 68 ad2antlr ⊢ A ∈ ℕ ∧ p ∈ 1 … A ∩ ℙ ∧ k ∈ 1 … p pCnt A → p ∈ ℙ
70 elfznn ⊢ k ∈ 1 … p pCnt A → k ∈ ℕ
71 70 adantl ⊢ A ∈ ℕ ∧ p ∈ 1 … A ∩ ℙ ∧ k ∈ 1 … p pCnt A → k ∈ ℕ
72 vmappw ⊢ p ∈ ℙ ∧ k ∈ ℕ → Λ ⁡ p k = log ⁡ p
73 69 71 72 syl2anc ⊢ A ∈ ℕ ∧ p ∈ 1 … A ∩ ℙ ∧ k ∈ 1 … p pCnt A → Λ ⁡ p k = log ⁡ p
74 73 sumeq2dv ⊢ A ∈ ℕ ∧ p ∈ 1 … A ∩ ℙ → ∑ k = 1 p pCnt A Λ ⁡ p k = ∑ k = 1 p pCnt A log ⁡ p
75 fzfid ⊢ A ∈ ℕ ∧ p ∈ 1 … A ∩ ℙ → 1 … p pCnt A ∈ Fin
76 68 21 syl ⊢ p ∈ 1 … A ∩ ℙ → p ∈ ℕ
77 76 adantl ⊢ A ∈ ℕ ∧ p ∈ 1 … A ∩ ℙ → p ∈ ℕ
78 77 nnrpd ⊢ A ∈ ℕ ∧ p ∈ 1 … A ∩ ℙ → p ∈ ℝ +
79 78 relogcld ⊢ A ∈ ℕ ∧ p ∈ 1 … A ∩ ℙ → log ⁡ p ∈ ℝ
80 79 recnd ⊢ A ∈ ℕ ∧ p ∈ 1 … A ∩ ℙ → log ⁡ p ∈ ℂ
81 fsumconst ⊢ 1 … p pCnt A ∈ Fin ∧ log ⁡ p ∈ ℂ → ∑ k = 1 p pCnt A log ⁡ p = 1 … p pCnt A ⁢ log ⁡ p
82 75 80 81 syl2anc ⊢ A ∈ ℕ ∧ p ∈ 1 … A ∩ ℙ → ∑ k = 1 p pCnt A log ⁡ p = 1 … p pCnt A ⁢ log ⁡ p
83 68 10 sylan2 ⊢ A ∈ ℕ ∧ p ∈ 1 … A ∩ ℙ → p pCnt A ∈ ℕ 0
84 hashfz1 ⊢ p pCnt A ∈ ℕ 0 → 1 … p pCnt A = p pCnt A
85 83 84 syl ⊢ A ∈ ℕ ∧ p ∈ 1 … A ∩ ℙ → 1 … p pCnt A = p pCnt A
86 85 oveq1d ⊢ A ∈ ℕ ∧ p ∈ 1 … A ∩ ℙ → 1 … p pCnt A ⁢ log ⁡ p = p pCnt A ⁢ log ⁡ p
87 74 82 86 3eqtrd ⊢ A ∈ ℕ ∧ p ∈ 1 … A ∩ ℙ → ∑ k = 1 p pCnt A Λ ⁡ p k = p pCnt A ⁢ log ⁡ p
88 87 sumeq2dv ⊢ A ∈ ℕ → ∑ p ∈ 1 … A ∩ ℙ ∑ k = 1 p pCnt A Λ ⁡ p k = ∑ p ∈ 1 … A ∩ ℙ p pCnt A ⁢ log ⁡ p
89 pclogsum ⊢ A ∈ ℕ → ∑ p ∈ 1 … A ∩ ℙ p pCnt A ⁢ log ⁡ p = log ⁡ A
90 67 88 89 3eqtrd ⊢ A ∈ ℕ → ∑ n ∈ x ∈ ℕ | x ∥ A Λ ⁡ n = log ⁡ A