Metamath Proof Explorer


Theorem modmulmod

Description: The product of a real number modulo a positive real number and an integer equals the product of the real number and the integer modulo the positive real number. (Contributed by Alexander van der Vekens, 17-May-2018)

Ref Expression
Assertion modmulmod ⊢ A ∈ ℝ ∧ B ∈ ℤ ∧ M ∈ ℝ + → A mod M ⁢ B mod M = A ⁢ B mod M

Proof

Step Hyp Ref Expression
1 modcl ⊢ A ∈ ℝ ∧ M ∈ ℝ + → A mod M ∈ ℝ
2 simpl ⊢ A ∈ ℝ ∧ M ∈ ℝ + → A ∈ ℝ
3 1 2 jca ⊢ A ∈ ℝ ∧ M ∈ ℝ + → A mod M ∈ ℝ ∧ A ∈ ℝ
4 3 3adant2 ⊢ A ∈ ℝ ∧ B ∈ ℤ ∧ M ∈ ℝ + → A mod M ∈ ℝ ∧ A ∈ ℝ
5 3simpc ⊢ A ∈ ℝ ∧ B ∈ ℤ ∧ M ∈ ℝ + → B ∈ ℤ ∧ M ∈ ℝ +
6 modabs2 ⊢ A ∈ ℝ ∧ M ∈ ℝ + → A mod M mod M = A mod M
7 6 3adant2 ⊢ A ∈ ℝ ∧ B ∈ ℤ ∧ M ∈ ℝ + → A mod M mod M = A mod M
8 modmul1 ⊢ A mod M ∈ ℝ ∧ A ∈ ℝ ∧ B ∈ ℤ ∧ M ∈ ℝ + ∧ A mod M mod M = A mod M → A mod M ⁢ B mod M = A ⁢ B mod M
9 4 5 7 8 syl3anc ⊢ A ∈ ℝ ∧ B ∈ ℤ ∧ M ∈ ℝ + → A mod M ⁢ B mod M = A ⁢ B mod M