Metamath Proof Explorer


Theorem modmulmodr

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

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

Proof

Step Hyp Ref Expression
1 zcn ⊢ A ∈ ℤ → A ∈ ℂ
2 1 3ad2ant1 ⊢ A ∈ ℤ ∧ B ∈ ℝ ∧ M ∈ ℝ + → A ∈ ℂ
3 simp2 ⊢ A ∈ ℤ ∧ B ∈ ℝ ∧ M ∈ ℝ + → B ∈ ℝ
4 simp3 ⊢ A ∈ ℤ ∧ B ∈ ℝ ∧ M ∈ ℝ + → M ∈ ℝ +
5 3 4 modcld ⊢ A ∈ ℤ ∧ B ∈ ℝ ∧ M ∈ ℝ + → B mod M ∈ ℝ
6 5 recnd ⊢ A ∈ ℤ ∧ B ∈ ℝ ∧ M ∈ ℝ + → B mod M ∈ ℂ
7 2 6 mulcomd ⊢ A ∈ ℤ ∧ B ∈ ℝ ∧ M ∈ ℝ + → A ⁢ B mod M = B mod M ⁢ A
8 7 oveq1d ⊢ A ∈ ℤ ∧ B ∈ ℝ ∧ M ∈ ℝ + → A ⁢ B mod M mod M = B mod M ⁢ A mod M
9 modmulmod ⊢ B ∈ ℝ ∧ A ∈ ℤ ∧ M ∈ ℝ + → B mod M ⁢ A mod M = B ⁢ A mod M
10 9 3com12 ⊢ A ∈ ℤ ∧ B ∈ ℝ ∧ M ∈ ℝ + → B mod M ⁢ A mod M = B ⁢ A mod M
11 recn ⊢ B ∈ ℝ → B ∈ ℂ
12 1 11 anim12ci ⊢ A ∈ ℤ ∧ B ∈ ℝ → B ∈ ℂ ∧ A ∈ ℂ
13 12 3adant3 ⊢ A ∈ ℤ ∧ B ∈ ℝ ∧ M ∈ ℝ + → B ∈ ℂ ∧ A ∈ ℂ
14 mulcom ⊢ B ∈ ℂ ∧ A ∈ ℂ → B ⁢ A = A ⁢ B
15 13 14 syl ⊢ A ∈ ℤ ∧ B ∈ ℝ ∧ M ∈ ℝ + → B ⁢ A = A ⁢ B
16 15 oveq1d ⊢ A ∈ ℤ ∧ B ∈ ℝ ∧ M ∈ ℝ + → B ⁢ A mod M = A ⁢ B mod M
17 8 10 16 3eqtrd ⊢ A ∈ ℤ ∧ B ∈ ℝ ∧ M ∈ ℝ + → A ⁢ B mod M mod M = A ⁢ B mod M