Metamath Proof Explorer


Theorem musum

Description: The sum of the Möbius function over the divisors of N gives one if N = 1 , but otherwise always sums to zero. Theorem 2.1 in ApostolNT p. 25. This makes the Möbius function useful for inverting divisor sums; see also muinv . (Contributed by Mario Carneiro, 2-Jul-2015)

Ref Expression
Assertion musum ⊢ N ∈ ℕ → ∑ k ∈ n ∈ ℕ | n ∥ N μ ⁡ k = if N = 1 1 0

Proof

Step Hyp Ref Expression
1 fveq2 ⊢ n = k → μ ⁡ n = μ ⁡ k
2 1 neeq1d ⊢ n = k → μ ⁡ n ≠ 0 ↔ μ ⁡ k ≠ 0
3 breq1 ⊢ n = k → n ∥ N ↔ k ∥ N
4 2 3 anbi12d ⊢ n = k → μ ⁡ n ≠ 0 ∧ n ∥ N ↔ μ ⁡ k ≠ 0 ∧ k ∥ N
5 4 elrab ⊢ k ∈ n ∈ ℕ | μ ⁡ n ≠ 0 ∧ n ∥ N ↔ k ∈ ℕ ∧ μ ⁡ k ≠ 0 ∧ k ∥ N
6 muval2 ⊢ k ∈ ℕ ∧ μ ⁡ k ≠ 0 → μ ⁡ k = − 1 p ∈ ℙ | p ∥ k
7 6 adantrr ⊢ k ∈ ℕ ∧ μ ⁡ k ≠ 0 ∧ k ∥ N → μ ⁡ k = − 1 p ∈ ℙ | p ∥ k
8 5 7 sylbi ⊢ k ∈ n ∈ ℕ | μ ⁡ n ≠ 0 ∧ n ∥ N → μ ⁡ k = − 1 p ∈ ℙ | p ∥ k
9 8 adantl ⊢ N ∈ ℕ ∧ k ∈ n ∈ ℕ | μ ⁡ n ≠ 0 ∧ n ∥ N → μ ⁡ k = − 1 p ∈ ℙ | p ∥ k
10 9 sumeq2dv ⊢ N ∈ ℕ → ∑ k ∈ n ∈ ℕ | μ ⁡ n ≠ 0 ∧ n ∥ N μ ⁡ k = ∑ k ∈ n ∈ ℕ | μ ⁡ n ≠ 0 ∧ n ∥ N − 1 p ∈ ℙ | p ∥ k
11 simpr ⊢ μ ⁡ n ≠ 0 ∧ n ∥ N → n ∥ N
12 11 a1i ⊢ N ∈ ℕ ∧ n ∈ ℕ → μ ⁡ n ≠ 0 ∧ n ∥ N → n ∥ N
13 12 ss2rabdv ⊢ N ∈ ℕ → n ∈ ℕ | μ ⁡ n ≠ 0 ∧ n ∥ N ⊆ n ∈ ℕ | n ∥ N
14 ssrab2 ⊢ n ∈ ℕ | μ ⁡ n ≠ 0 ∧ n ∥ N ⊆ ℕ
15 simpr ⊢ N ∈ ℕ ∧ k ∈ n ∈ ℕ | μ ⁡ n ≠ 0 ∧ n ∥ N → k ∈ n ∈ ℕ | μ ⁡ n ≠ 0 ∧ n ∥ N
16 14 15 sselid ⊢ N ∈ ℕ ∧ k ∈ n ∈ ℕ | μ ⁡ n ≠ 0 ∧ n ∥ N → k ∈ ℕ
17 mucl ⊢ k ∈ ℕ → μ ⁡ k ∈ ℤ
18 16 17 syl ⊢ N ∈ ℕ ∧ k ∈ n ∈ ℕ | μ ⁡ n ≠ 0 ∧ n ∥ N → μ ⁡ k ∈ ℤ
19 18 zcnd ⊢ N ∈ ℕ ∧ k ∈ n ∈ ℕ | μ ⁡ n ≠ 0 ∧ n ∥ N → μ ⁡ k ∈ ℂ
20 difrab ⊢ n ∈ ℕ | n ∥ N ∖ n ∈ ℕ | μ ⁡ n ≠ 0 ∧ n ∥ N = n ∈ ℕ | n ∥ N ∧ ¬ μ ⁡ n ≠ 0 ∧ n ∥ N
21 pm3.21 ⊢ n ∥ N → μ ⁡ n ≠ 0 → μ ⁡ n ≠ 0 ∧ n ∥ N
22 21 necon1bd ⊢ n ∥ N → ¬ μ ⁡ n ≠ 0 ∧ n ∥ N → μ ⁡ n = 0
23 22 imp ⊢ n ∥ N ∧ ¬ μ ⁡ n ≠ 0 ∧ n ∥ N → μ ⁡ n = 0
24 23 a1i ⊢ n ∈ ℕ → n ∥ N ∧ ¬ μ ⁡ n ≠ 0 ∧ n ∥ N → μ ⁡ n = 0
25 24 ss2rabi ⊢ n ∈ ℕ | n ∥ N ∧ ¬ μ ⁡ n ≠ 0 ∧ n ∥ N ⊆ n ∈ ℕ | μ ⁡ n = 0
26 20 25 eqsstri ⊢ n ∈ ℕ | n ∥ N ∖ n ∈ ℕ | μ ⁡ n ≠ 0 ∧ n ∥ N ⊆ n ∈ ℕ | μ ⁡ n = 0
27 26 sseli ⊢ k ∈ n ∈ ℕ | n ∥ N ∖ n ∈ ℕ | μ ⁡ n ≠ 0 ∧ n ∥ N → k ∈ n ∈ ℕ | μ ⁡ n = 0
28 fveqeq2 ⊢ n = k → μ ⁡ n = 0 ↔ μ ⁡ k = 0
29 28 elrab ⊢ k ∈ n ∈ ℕ | μ ⁡ n = 0 ↔ k ∈ ℕ ∧ μ ⁡ k = 0
30 29 simprbi ⊢ k ∈ n ∈ ℕ | μ ⁡ n = 0 → μ ⁡ k = 0
31 27 30 syl ⊢ k ∈ n ∈ ℕ | n ∥ N ∖ n ∈ ℕ | μ ⁡ n ≠ 0 ∧ n ∥ N → μ ⁡ k = 0
32 31 adantl ⊢ N ∈ ℕ ∧ k ∈ n ∈ ℕ | n ∥ N ∖ n ∈ ℕ | μ ⁡ n ≠ 0 ∧ n ∥ N → μ ⁡ k = 0
33 dvdsfi ⊢ N ∈ ℕ → n ∈ ℕ | n ∥ N ∈ Fin
34 13 19 32 33 fsumss ⊢ N ∈ ℕ → ∑ k ∈ n ∈ ℕ | μ ⁡ n ≠ 0 ∧ n ∥ N μ ⁡ k = ∑ k ∈ n ∈ ℕ | n ∥ N μ ⁡ k
35 fveq2 ⊢ x = p ∈ ℙ | p ∥ k → x = p ∈ ℙ | p ∥ k
36 35 oveq2d ⊢ x = p ∈ ℙ | p ∥ k → − 1 x = − 1 p ∈ ℙ | p ∥ k
37 33 13 ssfid ⊢ N ∈ ℕ → n ∈ ℕ | μ ⁡ n ≠ 0 ∧ n ∥ N ∈ Fin
38 eqid ⊢ n ∈ ℕ | μ ⁡ n ≠ 0 ∧ n ∥ N = n ∈ ℕ | μ ⁡ n ≠ 0 ∧ n ∥ N
39 eqid ⊢ m ∈ n ∈ ℕ | μ ⁡ n ≠ 0 ∧ n ∥ N ⟼ p ∈ ℙ | p ∥ m = m ∈ n ∈ ℕ | μ ⁡ n ≠ 0 ∧ n ∥ N ⟼ p ∈ ℙ | p ∥ m
40 oveq1 ⊢ q = p → q pCnt x = p pCnt x
41 40 cbvmptv ⊢ q ∈ ℙ ⟼ q pCnt x = p ∈ ℙ ⟼ p pCnt x
42 oveq2 ⊢ x = m → p pCnt x = p pCnt m
43 42 mpteq2dv ⊢ x = m → p ∈ ℙ ⟼ p pCnt x = p ∈ ℙ ⟼ p pCnt m
44 41 43 eqtrid ⊢ x = m → q ∈ ℙ ⟼ q pCnt x = p ∈ ℙ ⟼ p pCnt m
45 44 cbvmptv ⊢ x ∈ ℕ ⟼ q ∈ ℙ ⟼ q pCnt x = m ∈ ℕ ⟼ p ∈ ℙ ⟼ p pCnt m
46 38 39 45 sqff1o ⊢ N ∈ ℕ → m ∈ n ∈ ℕ | μ ⁡ n ≠ 0 ∧ n ∥ N ⟼ p ∈ ℙ | p ∥ m : n ∈ ℕ | μ ⁡ n ≠ 0 ∧ n ∥ N ⟶ 1-1 onto 𝒫 p ∈ ℙ | p ∥ N
47 breq2 ⊢ m = k → p ∥ m ↔ p ∥ k
48 47 rabbidv ⊢ m = k → p ∈ ℙ | p ∥ m = p ∈ ℙ | p ∥ k
49 prmex ⊢ ℙ ∈ V
50 49 rabex ⊢ p ∈ ℙ | p ∥ k ∈ V
51 48 39 50 fvmpt ⊢ k ∈ n ∈ ℕ | μ ⁡ n ≠ 0 ∧ n ∥ N → m ∈ n ∈ ℕ | μ ⁡ n ≠ 0 ∧ n ∥ N ⟼ p ∈ ℙ | p ∥ m ⁡ k = p ∈ ℙ | p ∥ k
52 51 adantl ⊢ N ∈ ℕ ∧ k ∈ n ∈ ℕ | μ ⁡ n ≠ 0 ∧ n ∥ N → m ∈ n ∈ ℕ | μ ⁡ n ≠ 0 ∧ n ∥ N ⟼ p ∈ ℙ | p ∥ m ⁡ k = p ∈ ℙ | p ∥ k
53 neg1cn ⊢ − 1 ∈ ℂ
54 prmdvdsfi ⊢ N ∈ ℕ → p ∈ ℙ | p ∥ N ∈ Fin
55 elpwi ⊢ x ∈ 𝒫 p ∈ ℙ | p ∥ N → x ⊆ p ∈ ℙ | p ∥ N
56 ssfi ⊢ p ∈ ℙ | p ∥ N ∈ Fin ∧ x ⊆ p ∈ ℙ | p ∥ N → x ∈ Fin
57 54 55 56 syl2an ⊢ N ∈ ℕ ∧ x ∈ 𝒫 p ∈ ℙ | p ∥ N → x ∈ Fin
58 hashcl ⊢ x ∈ Fin → x ∈ ℕ 0
59 57 58 syl ⊢ N ∈ ℕ ∧ x ∈ 𝒫 p ∈ ℙ | p ∥ N → x ∈ ℕ 0
60 expcl ⊢ − 1 ∈ ℂ ∧ x ∈ ℕ 0 → − 1 x ∈ ℂ
61 53 59 60 sylancr ⊢ N ∈ ℕ ∧ x ∈ 𝒫 p ∈ ℙ | p ∥ N → − 1 x ∈ ℂ
62 36 37 46 52 61 fsumf1o ⊢ N ∈ ℕ → ∑ x ∈ 𝒫 p ∈ ℙ | p ∥ N − 1 x = ∑ k ∈ n ∈ ℕ | μ ⁡ n ≠ 0 ∧ n ∥ N − 1 p ∈ ℙ | p ∥ k
63 fzfid ⊢ N ∈ ℕ → 0 … p ∈ ℙ | p ∥ N ∈ Fin
64 54 adantr ⊢ N ∈ ℕ ∧ z ∈ 0 … p ∈ ℙ | p ∥ N → p ∈ ℙ | p ∥ N ∈ Fin
65 pwfi ⊢ p ∈ ℙ | p ∥ N ∈ Fin ↔ 𝒫 p ∈ ℙ | p ∥ N ∈ Fin
66 64 65 sylib ⊢ N ∈ ℕ ∧ z ∈ 0 … p ∈ ℙ | p ∥ N → 𝒫 p ∈ ℙ | p ∥ N ∈ Fin
67 ssrab2 ⊢ s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z ⊆ 𝒫 p ∈ ℙ | p ∥ N
68 ssfi ⊢ 𝒫 p ∈ ℙ | p ∥ N ∈ Fin ∧ s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z ⊆ 𝒫 p ∈ ℙ | p ∥ N → s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z ∈ Fin
69 66 67 68 sylancl ⊢ N ∈ ℕ ∧ z ∈ 0 … p ∈ ℙ | p ∥ N → s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z ∈ Fin
70 simprr ⊢ N ∈ ℕ ∧ z ∈ 0 … p ∈ ℙ | p ∥ N ∧ x ∈ s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z → x ∈ s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z
71 fveqeq2 ⊢ s = x → s = z ↔ x = z
72 71 elrab ⊢ x ∈ s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z ↔ x ∈ 𝒫 p ∈ ℙ | p ∥ N ∧ x = z
73 72 simprbi ⊢ x ∈ s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z → x = z
74 70 73 syl ⊢ N ∈ ℕ ∧ z ∈ 0 … p ∈ ℙ | p ∥ N ∧ x ∈ s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z → x = z
75 74 ralrimivva ⊢ N ∈ ℕ → ∀ z ∈ 0 … p ∈ ℙ | p ∥ N ∀ x ∈ s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z x = z
76 invdisj ⊢ ∀ z ∈ 0 … p ∈ ℙ | p ∥ N ∀ x ∈ s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z x = z → Disj z = 0 p ∈ ℙ | p ∥ N s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z
77 75 76 syl ⊢ N ∈ ℕ → Disj z = 0 p ∈ ℙ | p ∥ N s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z
78 54 adantr ⊢ N ∈ ℕ ∧ z ∈ 0 … p ∈ ℙ | p ∥ N ∧ x ∈ s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z → p ∈ ℙ | p ∥ N ∈ Fin
79 67 70 sselid ⊢ N ∈ ℕ ∧ z ∈ 0 … p ∈ ℙ | p ∥ N ∧ x ∈ s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z → x ∈ 𝒫 p ∈ ℙ | p ∥ N
80 79 55 syl ⊢ N ∈ ℕ ∧ z ∈ 0 … p ∈ ℙ | p ∥ N ∧ x ∈ s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z → x ⊆ p ∈ ℙ | p ∥ N
81 78 80 ssfid ⊢ N ∈ ℕ ∧ z ∈ 0 … p ∈ ℙ | p ∥ N ∧ x ∈ s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z → x ∈ Fin
82 81 58 syl ⊢ N ∈ ℕ ∧ z ∈ 0 … p ∈ ℙ | p ∥ N ∧ x ∈ s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z → x ∈ ℕ 0
83 53 82 60 sylancr ⊢ N ∈ ℕ ∧ z ∈ 0 … p ∈ ℙ | p ∥ N ∧ x ∈ s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z → − 1 x ∈ ℂ
84 63 69 77 83 fsumiun ⊢ N ∈ ℕ → ∑ x ∈ ⋃ z = 0 p ∈ ℙ | p ∥ N s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z − 1 x = ∑ z = 0 p ∈ ℙ | p ∥ N ∑ x ∈ s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z − 1 x
85 iunrab ⊢ ⋃ z = 0 p ∈ ℙ | p ∥ N s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z = s ∈ 𝒫 p ∈ ℙ | p ∥ N | ∃ z ∈ 0 … p ∈ ℙ | p ∥ N s = z
86 54 adantr ⊢ N ∈ ℕ ∧ s ∈ 𝒫 p ∈ ℙ | p ∥ N → p ∈ ℙ | p ∥ N ∈ Fin
87 elpwi ⊢ s ∈ 𝒫 p ∈ ℙ | p ∥ N → s ⊆ p ∈ ℙ | p ∥ N
88 87 adantl ⊢ N ∈ ℕ ∧ s ∈ 𝒫 p ∈ ℙ | p ∥ N → s ⊆ p ∈ ℙ | p ∥ N
89 ssdomg ⊢ p ∈ ℙ | p ∥ N ∈ Fin → s ⊆ p ∈ ℙ | p ∥ N → s ≼ p ∈ ℙ | p ∥ N
90 86 88 89 sylc ⊢ N ∈ ℕ ∧ s ∈ 𝒫 p ∈ ℙ | p ∥ N → s ≼ p ∈ ℙ | p ∥ N
91 ssfi ⊢ p ∈ ℙ | p ∥ N ∈ Fin ∧ s ⊆ p ∈ ℙ | p ∥ N → s ∈ Fin
92 54 87 91 syl2an ⊢ N ∈ ℕ ∧ s ∈ 𝒫 p ∈ ℙ | p ∥ N → s ∈ Fin
93 hashdom ⊢ s ∈ Fin ∧ p ∈ ℙ | p ∥ N ∈ Fin → s ≤ p ∈ ℙ | p ∥ N ↔ s ≼ p ∈ ℙ | p ∥ N
94 92 86 93 syl2anc ⊢ N ∈ ℕ ∧ s ∈ 𝒫 p ∈ ℙ | p ∥ N → s ≤ p ∈ ℙ | p ∥ N ↔ s ≼ p ∈ ℙ | p ∥ N
95 90 94 mpbird ⊢ N ∈ ℕ ∧ s ∈ 𝒫 p ∈ ℙ | p ∥ N → s ≤ p ∈ ℙ | p ∥ N
96 hashcl ⊢ s ∈ Fin → s ∈ ℕ 0
97 92 96 syl ⊢ N ∈ ℕ ∧ s ∈ 𝒫 p ∈ ℙ | p ∥ N → s ∈ ℕ 0
98 nn0uz ⊢ ℕ 0 = ℤ ≥ 0
99 97 98 eleqtrdi ⊢ N ∈ ℕ ∧ s ∈ 𝒫 p ∈ ℙ | p ∥ N → s ∈ ℤ ≥ 0
100 hashcl ⊢ p ∈ ℙ | p ∥ N ∈ Fin → p ∈ ℙ | p ∥ N ∈ ℕ 0
101 54 100 syl ⊢ N ∈ ℕ → p ∈ ℙ | p ∥ N ∈ ℕ 0
102 101 adantr ⊢ N ∈ ℕ ∧ s ∈ 𝒫 p ∈ ℙ | p ∥ N → p ∈ ℙ | p ∥ N ∈ ℕ 0
103 102 nn0zd ⊢ N ∈ ℕ ∧ s ∈ 𝒫 p ∈ ℙ | p ∥ N → p ∈ ℙ | p ∥ N ∈ ℤ
104 elfz5 ⊢ s ∈ ℤ ≥ 0 ∧ p ∈ ℙ | p ∥ N ∈ ℤ → s ∈ 0 … p ∈ ℙ | p ∥ N ↔ s ≤ p ∈ ℙ | p ∥ N
105 99 103 104 syl2anc ⊢ N ∈ ℕ ∧ s ∈ 𝒫 p ∈ ℙ | p ∥ N → s ∈ 0 … p ∈ ℙ | p ∥ N ↔ s ≤ p ∈ ℙ | p ∥ N
106 95 105 mpbird ⊢ N ∈ ℕ ∧ s ∈ 𝒫 p ∈ ℙ | p ∥ N → s ∈ 0 … p ∈ ℙ | p ∥ N
107 eqidd ⊢ N ∈ ℕ ∧ s ∈ 𝒫 p ∈ ℙ | p ∥ N → s = s
108 eqeq2 ⊢ z = s → s = z ↔ s = s
109 108 rspcev ⊢ s ∈ 0 … p ∈ ℙ | p ∥ N ∧ s = s → ∃ z ∈ 0 … p ∈ ℙ | p ∥ N s = z
110 106 107 109 syl2anc ⊢ N ∈ ℕ ∧ s ∈ 𝒫 p ∈ ℙ | p ∥ N → ∃ z ∈ 0 … p ∈ ℙ | p ∥ N s = z
111 110 ralrimiva ⊢ N ∈ ℕ → ∀ s ∈ 𝒫 p ∈ ℙ | p ∥ N ∃ z ∈ 0 … p ∈ ℙ | p ∥ N s = z
112 rabid2 ⊢ 𝒫 p ∈ ℙ | p ∥ N = s ∈ 𝒫 p ∈ ℙ | p ∥ N | ∃ z ∈ 0 … p ∈ ℙ | p ∥ N s = z ↔ ∀ s ∈ 𝒫 p ∈ ℙ | p ∥ N ∃ z ∈ 0 … p ∈ ℙ | p ∥ N s = z
113 111 112 sylibr ⊢ N ∈ ℕ → 𝒫 p ∈ ℙ | p ∥ N = s ∈ 𝒫 p ∈ ℙ | p ∥ N | ∃ z ∈ 0 … p ∈ ℙ | p ∥ N s = z
114 85 113 eqtr4id ⊢ N ∈ ℕ → ⋃ z = 0 p ∈ ℙ | p ∥ N s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z = 𝒫 p ∈ ℙ | p ∥ N
115 114 sumeq1d ⊢ N ∈ ℕ → ∑ x ∈ ⋃ z = 0 p ∈ ℙ | p ∥ N s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z − 1 x = ∑ x ∈ 𝒫 p ∈ ℙ | p ∥ N − 1 x
116 elfznn0 ⊢ z ∈ 0 … p ∈ ℙ | p ∥ N → z ∈ ℕ 0
117 116 adantl ⊢ N ∈ ℕ ∧ z ∈ 0 … p ∈ ℙ | p ∥ N → z ∈ ℕ 0
118 expcl ⊢ − 1 ∈ ℂ ∧ z ∈ ℕ 0 → − 1 z ∈ ℂ
119 53 117 118 sylancr ⊢ N ∈ ℕ ∧ z ∈ 0 … p ∈ ℙ | p ∥ N → − 1 z ∈ ℂ
120 fsumconst ⊢ s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z ∈ Fin ∧ − 1 z ∈ ℂ → ∑ x ∈ s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z − 1 z = s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z ⁢ − 1 z
121 69 119 120 syl2anc ⊢ N ∈ ℕ ∧ z ∈ 0 … p ∈ ℙ | p ∥ N → ∑ x ∈ s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z − 1 z = s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z ⁢ − 1 z
122 73 adantl ⊢ N ∈ ℕ ∧ z ∈ 0 … p ∈ ℙ | p ∥ N ∧ x ∈ s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z → x = z
123 122 oveq2d ⊢ N ∈ ℕ ∧ z ∈ 0 … p ∈ ℙ | p ∥ N ∧ x ∈ s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z → − 1 x = − 1 z
124 123 sumeq2dv ⊢ N ∈ ℕ ∧ z ∈ 0 … p ∈ ℙ | p ∥ N → ∑ x ∈ s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z − 1 x = ∑ x ∈ s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z − 1 z
125 elfzelz ⊢ z ∈ 0 … p ∈ ℙ | p ∥ N → z ∈ ℤ
126 hashbc ⊢ p ∈ ℙ | p ∥ N ∈ Fin ∧ z ∈ ℤ → ( p ∈ ℙ | p ∥ N z) = s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z
127 54 125 126 syl2an ⊢ N ∈ ℕ ∧ z ∈ 0 … p ∈ ℙ | p ∥ N → ( p ∈ ℙ | p ∥ N z) = s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z
128 127 oveq1d ⊢ N ∈ ℕ ∧ z ∈ 0 … p ∈ ℙ | p ∥ N → ( p ∈ ℙ | p ∥ N z) ⁢ − 1 z = s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z ⁢ − 1 z
129 121 124 128 3eqtr4d ⊢ N ∈ ℕ ∧ z ∈ 0 … p ∈ ℙ | p ∥ N → ∑ x ∈ s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z − 1 x = ( p ∈ ℙ | p ∥ N z) ⁢ − 1 z
130 129 sumeq2dv ⊢ N ∈ ℕ → ∑ z = 0 p ∈ ℙ | p ∥ N ∑ x ∈ s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z − 1 x = ∑ z = 0 p ∈ ℙ | p ∥ N ( p ∈ ℙ | p ∥ N z) ⁢ − 1 z
131 1pneg1e0 ⊢ 1 + -1 = 0
132 131 oveq1i ⊢ 1 + -1 p ∈ ℙ | p ∥ N = 0 p ∈ ℙ | p ∥ N
133 binom1p ⊢ − 1 ∈ ℂ ∧ p ∈ ℙ | p ∥ N ∈ ℕ 0 → 1 + -1 p ∈ ℙ | p ∥ N = ∑ z = 0 p ∈ ℙ | p ∥ N ( p ∈ ℙ | p ∥ N z) ⁢ − 1 z
134 53 101 133 sylancr ⊢ N ∈ ℕ → 1 + -1 p ∈ ℙ | p ∥ N = ∑ z = 0 p ∈ ℙ | p ∥ N ( p ∈ ℙ | p ∥ N z) ⁢ − 1 z
135 132 134 eqtr3id ⊢ N ∈ ℕ → 0 p ∈ ℙ | p ∥ N = ∑ z = 0 p ∈ ℙ | p ∥ N ( p ∈ ℙ | p ∥ N z) ⁢ − 1 z
136 eqeq2 ⊢ 1 = if N = 1 1 0 → 0 p ∈ ℙ | p ∥ N = 1 ↔ 0 p ∈ ℙ | p ∥ N = if N = 1 1 0
137 eqeq2 ⊢ 0 = if N = 1 1 0 → 0 p ∈ ℙ | p ∥ N = 0 ↔ 0 p ∈ ℙ | p ∥ N = if N = 1 1 0
138 nprmdvds1 ⊢ p ∈ ℙ → ¬ p ∥ 1
139 simpr ⊢ N ∈ ℕ ∧ N = 1 → N = 1
140 139 breq2d ⊢ N ∈ ℕ ∧ N = 1 → p ∥ N ↔ p ∥ 1
141 140 notbid ⊢ N ∈ ℕ ∧ N = 1 → ¬ p ∥ N ↔ ¬ p ∥ 1
142 138 141 imbitrrid ⊢ N ∈ ℕ ∧ N = 1 → p ∈ ℙ → ¬ p ∥ N
143 142 ralrimiv ⊢ N ∈ ℕ ∧ N = 1 → ∀ p ∈ ℙ ¬ p ∥ N
144 rabeq0 ⊢ p ∈ ℙ | p ∥ N = ∅ ↔ ∀ p ∈ ℙ ¬ p ∥ N
145 143 144 sylibr ⊢ N ∈ ℕ ∧ N = 1 → p ∈ ℙ | p ∥ N = ∅
146 145 fveq2d ⊢ N ∈ ℕ ∧ N = 1 → p ∈ ℙ | p ∥ N = ∅
147 hash0 ⊢ ∅ = 0
148 146 147 eqtrdi ⊢ N ∈ ℕ ∧ N = 1 → p ∈ ℙ | p ∥ N = 0
149 148 oveq2d ⊢ N ∈ ℕ ∧ N = 1 → 0 p ∈ ℙ | p ∥ N = 0 0
150 0exp0e1 ⊢ 0 0 = 1
151 149 150 eqtrdi ⊢ N ∈ ℕ ∧ N = 1 → 0 p ∈ ℙ | p ∥ N = 1
152 df-ne ⊢ N ≠ 1 ↔ ¬ N = 1
153 eluz2b3 ⊢ N ∈ ℤ ≥ 2 ↔ N ∈ ℕ ∧ N ≠ 1
154 153 biimpri ⊢ N ∈ ℕ ∧ N ≠ 1 → N ∈ ℤ ≥ 2
155 152 154 sylan2br ⊢ N ∈ ℕ ∧ ¬ N = 1 → N ∈ ℤ ≥ 2
156 exprmfct ⊢ N ∈ ℤ ≥ 2 → ∃ p ∈ ℙ p ∥ N
157 155 156 syl ⊢ N ∈ ℕ ∧ ¬ N = 1 → ∃ p ∈ ℙ p ∥ N
158 rabn0 ⊢ p ∈ ℙ | p ∥ N ≠ ∅ ↔ ∃ p ∈ ℙ p ∥ N
159 157 158 sylibr ⊢ N ∈ ℕ ∧ ¬ N = 1 → p ∈ ℙ | p ∥ N ≠ ∅
160 54 adantr ⊢ N ∈ ℕ ∧ ¬ N = 1 → p ∈ ℙ | p ∥ N ∈ Fin
161 hashnncl ⊢ p ∈ ℙ | p ∥ N ∈ Fin → p ∈ ℙ | p ∥ N ∈ ℕ ↔ p ∈ ℙ | p ∥ N ≠ ∅
162 160 161 syl ⊢ N ∈ ℕ ∧ ¬ N = 1 → p ∈ ℙ | p ∥ N ∈ ℕ ↔ p ∈ ℙ | p ∥ N ≠ ∅
163 159 162 mpbird ⊢ N ∈ ℕ ∧ ¬ N = 1 → p ∈ ℙ | p ∥ N ∈ ℕ
164 163 0expd ⊢ N ∈ ℕ ∧ ¬ N = 1 → 0 p ∈ ℙ | p ∥ N = 0
165 136 137 151 164 ifbothda ⊢ N ∈ ℕ → 0 p ∈ ℙ | p ∥ N = if N = 1 1 0
166 130 135 165 3eqtr2d ⊢ N ∈ ℕ → ∑ z = 0 p ∈ ℙ | p ∥ N ∑ x ∈ s ∈ 𝒫 p ∈ ℙ | p ∥ N | s = z − 1 x = if N = 1 1 0
167 84 115 166 3eqtr3d ⊢ N ∈ ℕ → ∑ x ∈ 𝒫 p ∈ ℙ | p ∥ N − 1 x = if N = 1 1 0
168 62 167 eqtr3d ⊢ N ∈ ℕ → ∑ k ∈ n ∈ ℕ | μ ⁡ n ≠ 0 ∧ n ∥ N − 1 p ∈ ℙ | p ∥ k = if N = 1 1 0
169 10 34 168 3eqtr3d ⊢ N ∈ ℕ → ∑ k ∈ n ∈ ℕ | n ∥ N μ ⁡ k = if N = 1 1 0