Metamath Proof Explorer


Theorem pclogsum

Description: The logarithmic analogue of pcprod . The sum of the logarithms of the primes dividing A multiplied by their powers yields the logarithm of A . (Contributed by Mario Carneiro, 15-Apr-2016)

Ref Expression
Assertion pclogsum ⊢ A ∈ ℕ → ∑ p ∈ 1 … A ∩ ℙ p pCnt A ⁢ log ⁡ p = log ⁡ A

Proof

Step Hyp Ref Expression
1 elin ⊢ p ∈ 1 … A ∩ ℙ ↔ p ∈ 1 … A ∧ p ∈ ℙ
2 1 baib ⊢ p ∈ 1 … A → p ∈ 1 … A ∩ ℙ ↔ p ∈ ℙ
3 2 ifbid ⊢ p ∈ 1 … A → if p ∈ 1 … A ∩ ℙ log ⁡ p p pCnt A 0 = if p ∈ ℙ log ⁡ p p pCnt A 0
4 fvif ⊢ log ⁡ if p ∈ ℙ p p pCnt A 1 = if p ∈ ℙ log ⁡ p p pCnt A log ⁡ 1
5 log1 ⊢ log ⁡ 1 = 0
6 ifeq2 ⊢ log ⁡ 1 = 0 → if p ∈ ℙ log ⁡ p p pCnt A log ⁡ 1 = if p ∈ ℙ log ⁡ p p pCnt A 0
7 5 6 ax-mp ⊢ if p ∈ ℙ log ⁡ p p pCnt A log ⁡ 1 = if p ∈ ℙ log ⁡ p p pCnt A 0
8 4 7 eqtri ⊢ log ⁡ if p ∈ ℙ p p pCnt A 1 = if p ∈ ℙ log ⁡ p p pCnt A 0
9 3 8 eqtr4di ⊢ p ∈ 1 … A → if p ∈ 1 … A ∩ ℙ log ⁡ p p pCnt A 0 = log ⁡ if p ∈ ℙ p p pCnt A 1
10 9 sumeq2i ⊢ ∑ p = 1 A if p ∈ 1 … A ∩ ℙ log ⁡ p p pCnt A 0 = ∑ p = 1 A log ⁡ if p ∈ ℙ p p pCnt A 1
11 inss1 ⊢ 1 … A ∩ ℙ ⊆ 1 … A
12 simpr ⊢ A ∈ ℕ ∧ p ∈ 1 … A ∩ ℙ → p ∈ 1 … A ∩ ℙ
13 12 elin1d ⊢ A ∈ ℕ ∧ p ∈ 1 … A ∩ ℙ → p ∈ 1 … A
14 elfznn ⊢ p ∈ 1 … A → p ∈ ℕ
15 13 14 syl ⊢ A ∈ ℕ ∧ p ∈ 1 … A ∩ ℙ → p ∈ ℕ
16 12 elin2d ⊢ A ∈ ℕ ∧ p ∈ 1 … A ∩ ℙ → p ∈ ℙ
17 simpl ⊢ A ∈ ℕ ∧ p ∈ 1 … A ∩ ℙ → A ∈ ℕ
18 16 17 pccld ⊢ A ∈ ℕ ∧ p ∈ 1 … A ∩ ℙ → p pCnt A ∈ ℕ 0
19 15 18 nnexpcld ⊢ A ∈ ℕ ∧ p ∈ 1 … A ∩ ℙ → p p pCnt A ∈ ℕ
20 19 nnrpd ⊢ A ∈ ℕ ∧ p ∈ 1 … A ∩ ℙ → p p pCnt A ∈ ℝ +
21 20 relogcld ⊢ A ∈ ℕ ∧ p ∈ 1 … A ∩ ℙ → log ⁡ p p pCnt A ∈ ℝ
22 21 recnd ⊢ A ∈ ℕ ∧ p ∈ 1 … A ∩ ℙ → log ⁡ p p pCnt A ∈ ℂ
23 22 ralrimiva ⊢ A ∈ ℕ → ∀ p ∈ 1 … A ∩ ℙ log ⁡ p p pCnt A ∈ ℂ
24 fzfi ⊢ 1 … A ∈ Fin
25 24 olci ⊢ 1 … A ⊆ ℤ ≥ 1 ∨ 1 … A ∈ Fin
26 sumss2 ⊢ 1 … A ∩ ℙ ⊆ 1 … A ∧ ∀ p ∈ 1 … A ∩ ℙ log ⁡ p p pCnt A ∈ ℂ ∧ 1 … A ⊆ ℤ ≥ 1 ∨ 1 … A ∈ Fin → ∑ p ∈ 1 … A ∩ ℙ log ⁡ p p pCnt A = ∑ p = 1 A if p ∈ 1 … A ∩ ℙ log ⁡ p p pCnt A 0
27 25 26 mpan2 ⊢ 1 … A ∩ ℙ ⊆ 1 … A ∧ ∀ p ∈ 1 … A ∩ ℙ log ⁡ p p pCnt A ∈ ℂ → ∑ p ∈ 1 … A ∩ ℙ log ⁡ p p pCnt A = ∑ p = 1 A if p ∈ 1 … A ∩ ℙ log ⁡ p p pCnt A 0
28 11 23 27 sylancr ⊢ A ∈ ℕ → ∑ p ∈ 1 … A ∩ ℙ log ⁡ p p pCnt A = ∑ p = 1 A if p ∈ 1 … A ∩ ℙ log ⁡ p p pCnt A 0
29 15 nnrpd ⊢ A ∈ ℕ ∧ p ∈ 1 … A ∩ ℙ → p ∈ ℝ +
30 18 nn0zd ⊢ A ∈ ℕ ∧ p ∈ 1 … A ∩ ℙ → p pCnt A ∈ ℤ
31 relogexp ⊢ p ∈ ℝ + ∧ p pCnt A ∈ ℤ → log ⁡ p p pCnt A = p pCnt A ⁢ log ⁡ p
32 29 30 31 syl2anc ⊢ A ∈ ℕ ∧ p ∈ 1 … A ∩ ℙ → log ⁡ p p pCnt A = p pCnt A ⁢ log ⁡ p
33 32 sumeq2dv ⊢ A ∈ ℕ → ∑ p ∈ 1 … A ∩ ℙ log ⁡ p p pCnt A = ∑ p ∈ 1 … A ∩ ℙ p pCnt A ⁢ log ⁡ p
34 28 33 eqtr3d ⊢ A ∈ ℕ → ∑ p = 1 A if p ∈ 1 … A ∩ ℙ log ⁡ p p pCnt A 0 = ∑ p ∈ 1 … A ∩ ℙ p pCnt A ⁢ log ⁡ p
35 14 adantl ⊢ A ∈ ℕ ∧ p ∈ 1 … A → p ∈ ℕ
36 eleq1w ⊢ n = p → n ∈ ℙ ↔ p ∈ ℙ
37 id ⊢ n = p → n = p
38 oveq1 ⊢ n = p → n pCnt A = p pCnt A
39 37 38 oveq12d ⊢ n = p → n n pCnt A = p p pCnt A
40 36 39 ifbieq1d ⊢ n = p → if n ∈ ℙ n n pCnt A 1 = if p ∈ ℙ p p pCnt A 1
41 40 fveq2d ⊢ n = p → log ⁡ if n ∈ ℙ n n pCnt A 1 = log ⁡ if p ∈ ℙ p p pCnt A 1
42 eqid ⊢ n ∈ ℕ ⟼ log ⁡ if n ∈ ℙ n n pCnt A 1 = n ∈ ℕ ⟼ log ⁡ if n ∈ ℙ n n pCnt A 1
43 fvex ⊢ log ⁡ if p ∈ ℙ p p pCnt A 1 ∈ V
44 41 42 43 fvmpt ⊢ p ∈ ℕ → n ∈ ℕ ⟼ log ⁡ if n ∈ ℙ n n pCnt A 1 ⁡ p = log ⁡ if p ∈ ℙ p p pCnt A 1
45 35 44 syl ⊢ A ∈ ℕ ∧ p ∈ 1 … A → n ∈ ℕ ⟼ log ⁡ if n ∈ ℙ n n pCnt A 1 ⁡ p = log ⁡ if p ∈ ℙ p p pCnt A 1
46 elnnuz ⊢ A ∈ ℕ ↔ A ∈ ℤ ≥ 1
47 46 biimpi ⊢ A ∈ ℕ → A ∈ ℤ ≥ 1
48 35 adantr ⊢ A ∈ ℕ ∧ p ∈ 1 … A ∧ p ∈ ℙ → p ∈ ℕ
49 simpr ⊢ A ∈ ℕ ∧ p ∈ 1 … A ∧ p ∈ ℙ → p ∈ ℙ
50 simpll ⊢ A ∈ ℕ ∧ p ∈ 1 … A ∧ p ∈ ℙ → A ∈ ℕ
51 49 50 pccld ⊢ A ∈ ℕ ∧ p ∈ 1 … A ∧ p ∈ ℙ → p pCnt A ∈ ℕ 0
52 48 51 nnexpcld ⊢ A ∈ ℕ ∧ p ∈ 1 … A ∧ p ∈ ℙ → p p pCnt A ∈ ℕ
53 1nn ⊢ 1 ∈ ℕ
54 53 a1i ⊢ A ∈ ℕ ∧ p ∈ 1 … A ∧ ¬ p ∈ ℙ → 1 ∈ ℕ
55 52 54 ifclda ⊢ A ∈ ℕ ∧ p ∈ 1 … A → if p ∈ ℙ p p pCnt A 1 ∈ ℕ
56 55 nnrpd ⊢ A ∈ ℕ ∧ p ∈ 1 … A → if p ∈ ℙ p p pCnt A 1 ∈ ℝ +
57 56 relogcld ⊢ A ∈ ℕ ∧ p ∈ 1 … A → log ⁡ if p ∈ ℙ p p pCnt A 1 ∈ ℝ
58 57 recnd ⊢ A ∈ ℕ ∧ p ∈ 1 … A → log ⁡ if p ∈ ℙ p p pCnt A 1 ∈ ℂ
59 45 47 58 fsumser ⊢ A ∈ ℕ → ∑ p = 1 A log ⁡ if p ∈ ℙ p p pCnt A 1 = seq 1 + n ∈ ℕ ⟼ log ⁡ if n ∈ ℙ n n pCnt A 1 ⁡ A
60 rpmulcl ⊢ p ∈ ℝ + ∧ m ∈ ℝ + → p ⁢ m ∈ ℝ +
61 60 adantl ⊢ A ∈ ℕ ∧ p ∈ ℝ + ∧ m ∈ ℝ + → p ⁢ m ∈ ℝ +
62 eqid ⊢ n ∈ ℕ ⟼ if n ∈ ℙ n n pCnt A 1 = n ∈ ℕ ⟼ if n ∈ ℙ n n pCnt A 1
63 ovex ⊢ p p pCnt A ∈ V
64 1ex ⊢ 1 ∈ V
65 63 64 ifex ⊢ if p ∈ ℙ p p pCnt A 1 ∈ V
66 40 62 65 fvmpt ⊢ p ∈ ℕ → n ∈ ℕ ⟼ if n ∈ ℙ n n pCnt A 1 ⁡ p = if p ∈ ℙ p p pCnt A 1
67 35 66 syl ⊢ A ∈ ℕ ∧ p ∈ 1 … A → n ∈ ℕ ⟼ if n ∈ ℙ n n pCnt A 1 ⁡ p = if p ∈ ℙ p p pCnt A 1
68 67 56 eqeltrd ⊢ A ∈ ℕ ∧ p ∈ 1 … A → n ∈ ℕ ⟼ if n ∈ ℙ n n pCnt A 1 ⁡ p ∈ ℝ +
69 relogmul ⊢ p ∈ ℝ + ∧ m ∈ ℝ + → log ⁡ p ⁢ m = log ⁡ p + log ⁡ m
70 69 adantl ⊢ A ∈ ℕ ∧ p ∈ ℝ + ∧ m ∈ ℝ + → log ⁡ p ⁢ m = log ⁡ p + log ⁡ m
71 67 fveq2d ⊢ A ∈ ℕ ∧ p ∈ 1 … A → log ⁡ n ∈ ℕ ⟼ if n ∈ ℙ n n pCnt A 1 ⁡ p = log ⁡ if p ∈ ℙ p p pCnt A 1
72 71 45 eqtr4d ⊢ A ∈ ℕ ∧ p ∈ 1 … A → log ⁡ n ∈ ℕ ⟼ if n ∈ ℙ n n pCnt A 1 ⁡ p = n ∈ ℕ ⟼ log ⁡ if n ∈ ℙ n n pCnt A 1 ⁡ p
73 61 68 47 70 72 seqhomo ⊢ A ∈ ℕ → log ⁡ seq 1 × n ∈ ℕ ⟼ if n ∈ ℙ n n pCnt A 1 ⁡ A = seq 1 + n ∈ ℕ ⟼ log ⁡ if n ∈ ℙ n n pCnt A 1 ⁡ A
74 62 pcprod ⊢ A ∈ ℕ → seq 1 × n ∈ ℕ ⟼ if n ∈ ℙ n n pCnt A 1 ⁡ A = A
75 74 fveq2d ⊢ A ∈ ℕ → log ⁡ seq 1 × n ∈ ℕ ⟼ if n ∈ ℙ n n pCnt A 1 ⁡ A = log ⁡ A
76 59 73 75 3eqtr2d ⊢ A ∈ ℕ → ∑ p = 1 A log ⁡ if p ∈ ℙ p p pCnt A 1 = log ⁡ A
77 10 34 76 3eqtr3a ⊢ A ∈ ℕ → ∑ p ∈ 1 … A ∩ ℙ p pCnt A ⁢ log ⁡ p = log ⁡ A