Metamath Proof Explorer


Theorem sgmmul

Description: The divisor function for fixed parameter A is a multiplicative function. (Contributed by Mario Carneiro, 2-Jul-2015)

Ref Expression
Assertion sgmmul ⊢ A ∈ ℂ ∧ M ∈ ℕ ∧ N ∈ ℕ ∧ M gcd N = 1 → A σ M ⋅ N = A σ M ⁢ A σ N

Proof

Step Hyp Ref Expression
1 simpr1 ⊢ A ∈ ℂ ∧ M ∈ ℕ ∧ N ∈ ℕ ∧ M gcd N = 1 → M ∈ ℕ
2 simpr2 ⊢ A ∈ ℂ ∧ M ∈ ℕ ∧ N ∈ ℕ ∧ M gcd N = 1 → N ∈ ℕ
3 simpr3 ⊢ A ∈ ℂ ∧ M ∈ ℕ ∧ N ∈ ℕ ∧ M gcd N = 1 → M gcd N = 1
4 eqid ⊢ x ∈ ℕ | x ∥ M = x ∈ ℕ | x ∥ M
5 eqid ⊢ x ∈ ℕ | x ∥ N = x ∈ ℕ | x ∥ N
6 eqid ⊢ x ∈ ℕ | x ∥ M ⋅ N = x ∈ ℕ | x ∥ M ⋅ N
7 ssrab2 ⊢ x ∈ ℕ | x ∥ M ⊆ ℕ
8 simpr ⊢ A ∈ ℂ ∧ M ∈ ℕ ∧ N ∈ ℕ ∧ M gcd N = 1 ∧ j ∈ x ∈ ℕ | x ∥ M → j ∈ x ∈ ℕ | x ∥ M
9 7 8 sselid ⊢ A ∈ ℂ ∧ M ∈ ℕ ∧ N ∈ ℕ ∧ M gcd N = 1 ∧ j ∈ x ∈ ℕ | x ∥ M → j ∈ ℕ
10 9 nncnd ⊢ A ∈ ℂ ∧ M ∈ ℕ ∧ N ∈ ℕ ∧ M gcd N = 1 ∧ j ∈ x ∈ ℕ | x ∥ M → j ∈ ℂ
11 simpll ⊢ A ∈ ℂ ∧ M ∈ ℕ ∧ N ∈ ℕ ∧ M gcd N = 1 ∧ j ∈ x ∈ ℕ | x ∥ M → A ∈ ℂ
12 10 11 cxpcld ⊢ A ∈ ℂ ∧ M ∈ ℕ ∧ N ∈ ℕ ∧ M gcd N = 1 ∧ j ∈ x ∈ ℕ | x ∥ M → j A ∈ ℂ
13 ssrab2 ⊢ x ∈ ℕ | x ∥ N ⊆ ℕ
14 simpr ⊢ A ∈ ℂ ∧ M ∈ ℕ ∧ N ∈ ℕ ∧ M gcd N = 1 ∧ k ∈ x ∈ ℕ | x ∥ N → k ∈ x ∈ ℕ | x ∥ N
15 13 14 sselid ⊢ A ∈ ℂ ∧ M ∈ ℕ ∧ N ∈ ℕ ∧ M gcd N = 1 ∧ k ∈ x ∈ ℕ | x ∥ N → k ∈ ℕ
16 15 nncnd ⊢ A ∈ ℂ ∧ M ∈ ℕ ∧ N ∈ ℕ ∧ M gcd N = 1 ∧ k ∈ x ∈ ℕ | x ∥ N → k ∈ ℂ
17 simpll ⊢ A ∈ ℂ ∧ M ∈ ℕ ∧ N ∈ ℕ ∧ M gcd N = 1 ∧ k ∈ x ∈ ℕ | x ∥ N → A ∈ ℂ
18 16 17 cxpcld ⊢ A ∈ ℂ ∧ M ∈ ℕ ∧ N ∈ ℕ ∧ M gcd N = 1 ∧ k ∈ x ∈ ℕ | x ∥ N → k A ∈ ℂ
19 9 adantrr ⊢ A ∈ ℂ ∧ M ∈ ℕ ∧ N ∈ ℕ ∧ M gcd N = 1 ∧ j ∈ x ∈ ℕ | x ∥ M ∧ k ∈ x ∈ ℕ | x ∥ N → j ∈ ℕ
20 19 nnred ⊢ A ∈ ℂ ∧ M ∈ ℕ ∧ N ∈ ℕ ∧ M gcd N = 1 ∧ j ∈ x ∈ ℕ | x ∥ M ∧ k ∈ x ∈ ℕ | x ∥ N → j ∈ ℝ
21 19 nnnn0d ⊢ A ∈ ℂ ∧ M ∈ ℕ ∧ N ∈ ℕ ∧ M gcd N = 1 ∧ j ∈ x ∈ ℕ | x ∥ M ∧ k ∈ x ∈ ℕ | x ∥ N → j ∈ ℕ 0
22 21 nn0ge0d ⊢ A ∈ ℂ ∧ M ∈ ℕ ∧ N ∈ ℕ ∧ M gcd N = 1 ∧ j ∈ x ∈ ℕ | x ∥ M ∧ k ∈ x ∈ ℕ | x ∥ N → 0 ≤ j
23 15 adantrl ⊢ A ∈ ℂ ∧ M ∈ ℕ ∧ N ∈ ℕ ∧ M gcd N = 1 ∧ j ∈ x ∈ ℕ | x ∥ M ∧ k ∈ x ∈ ℕ | x ∥ N → k ∈ ℕ
24 23 nnred ⊢ A ∈ ℂ ∧ M ∈ ℕ ∧ N ∈ ℕ ∧ M gcd N = 1 ∧ j ∈ x ∈ ℕ | x ∥ M ∧ k ∈ x ∈ ℕ | x ∥ N → k ∈ ℝ
25 23 nnnn0d ⊢ A ∈ ℂ ∧ M ∈ ℕ ∧ N ∈ ℕ ∧ M gcd N = 1 ∧ j ∈ x ∈ ℕ | x ∥ M ∧ k ∈ x ∈ ℕ | x ∥ N → k ∈ ℕ 0
26 25 nn0ge0d ⊢ A ∈ ℂ ∧ M ∈ ℕ ∧ N ∈ ℕ ∧ M gcd N = 1 ∧ j ∈ x ∈ ℕ | x ∥ M ∧ k ∈ x ∈ ℕ | x ∥ N → 0 ≤ k
27 simpll ⊢ A ∈ ℂ ∧ M ∈ ℕ ∧ N ∈ ℕ ∧ M gcd N = 1 ∧ j ∈ x ∈ ℕ | x ∥ M ∧ k ∈ x ∈ ℕ | x ∥ N → A ∈ ℂ
28 20 22 24 26 27 mulcxpd ⊢ A ∈ ℂ ∧ M ∈ ℕ ∧ N ∈ ℕ ∧ M gcd N = 1 ∧ j ∈ x ∈ ℕ | x ∥ M ∧ k ∈ x ∈ ℕ | x ∥ N → j ⁢ k A = j A ⁢ k A
29 28 eqcomd ⊢ A ∈ ℂ ∧ M ∈ ℕ ∧ N ∈ ℕ ∧ M gcd N = 1 ∧ j ∈ x ∈ ℕ | x ∥ M ∧ k ∈ x ∈ ℕ | x ∥ N → j A ⁢ k A = j ⁢ k A
30 oveq1 ⊢ i = j ⁢ k → i A = j ⁢ k A
31 1 2 3 4 5 6 12 18 29 30 fsumdvdsmul ⊢ A ∈ ℂ ∧ M ∈ ℕ ∧ N ∈ ℕ ∧ M gcd N = 1 → ∑ j ∈ x ∈ ℕ | x ∥ M j A ⁢ ∑ k ∈ x ∈ ℕ | x ∥ N k A = ∑ i ∈ x ∈ ℕ | x ∥ M ⋅ N i A
32 sgmval ⊢ A ∈ ℂ ∧ M ∈ ℕ → A σ M = ∑ j ∈ x ∈ ℕ | x ∥ M j A
33 1 32 syldan ⊢ A ∈ ℂ ∧ M ∈ ℕ ∧ N ∈ ℕ ∧ M gcd N = 1 → A σ M = ∑ j ∈ x ∈ ℕ | x ∥ M j A
34 sgmval ⊢ A ∈ ℂ ∧ N ∈ ℕ → A σ N = ∑ k ∈ x ∈ ℕ | x ∥ N k A
35 2 34 syldan ⊢ A ∈ ℂ ∧ M ∈ ℕ ∧ N ∈ ℕ ∧ M gcd N = 1 → A σ N = ∑ k ∈ x ∈ ℕ | x ∥ N k A
36 33 35 oveq12d ⊢ A ∈ ℂ ∧ M ∈ ℕ ∧ N ∈ ℕ ∧ M gcd N = 1 → A σ M ⁢ A σ N = ∑ j ∈ x ∈ ℕ | x ∥ M j A ⁢ ∑ k ∈ x ∈ ℕ | x ∥ N k A
37 1 2 nnmulcld ⊢ A ∈ ℂ ∧ M ∈ ℕ ∧ N ∈ ℕ ∧ M gcd N = 1 → M ⋅ N ∈ ℕ
38 sgmval ⊢ A ∈ ℂ ∧ M ⋅ N ∈ ℕ → A σ M ⋅ N = ∑ i ∈ x ∈ ℕ | x ∥ M ⋅ N i A
39 37 38 syldan ⊢ A ∈ ℂ ∧ M ∈ ℕ ∧ N ∈ ℕ ∧ M gcd N = 1 → A σ M ⋅ N = ∑ i ∈ x ∈ ℕ | x ∥ M ⋅ N i A
40 31 36 39 3eqtr4rd ⊢ A ∈ ℂ ∧ M ∈ ℕ ∧ N ∈ ℕ ∧ M gcd N = 1 → A σ M ⋅ N = A σ M ⁢ A σ N