Metamath Proof Explorer


Theorem modadd2mod

Description: The sum of a real number modulo a positive real number and another real number equals the sum of the two real numbers modulo the positive real number. (Contributed by Alexander van der Vekens, 17-May-2018)

Ref Expression
Assertion modadd2mod ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ M ∈ ℝ + → B + A mod M mod M = B + A mod M

Proof

Step Hyp Ref Expression
1 recn ⊢ B ∈ ℝ → B ∈ ℂ
2 1 3ad2ant2 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ M ∈ ℝ + → B ∈ ℂ
3 modcl ⊢ A ∈ ℝ ∧ M ∈ ℝ + → A mod M ∈ ℝ
4 3 recnd ⊢ A ∈ ℝ ∧ M ∈ ℝ + → A mod M ∈ ℂ
5 4 3adant2 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ M ∈ ℝ + → A mod M ∈ ℂ
6 2 5 addcomd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ M ∈ ℝ + → B + A mod M = A mod M + B
7 6 oveq1d ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ M ∈ ℝ + → B + A mod M mod M = A mod M + B mod M
8 modaddmod ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ M ∈ ℝ + → A mod M + B mod M = A + B mod M
9 recn ⊢ A ∈ ℝ → A ∈ ℂ
10 addcom ⊢ A ∈ ℂ ∧ B ∈ ℂ → A + B = B + A
11 9 1 10 syl2an ⊢ A ∈ ℝ ∧ B ∈ ℝ → A + B = B + A
12 11 oveq1d ⊢ A ∈ ℝ ∧ B ∈ ℝ → A + B mod M = B + A mod M
13 12 3adant3 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ M ∈ ℝ + → A + B mod M = B + A mod M
14 7 8 13 3eqtrd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ M ∈ ℝ + → B + A mod M mod M = B + A mod M