Metamath Proof Explorer


Theorem muladdmod

Description: A real number is the sum of the number and a multiple of a positive real number modulo the positive real number. (Contributed by AV, 7-Sep-2025)

Ref Expression
Assertion muladdmod ⊢ A ∈ ℝ ∧ M ∈ ℝ + ∧ N ∈ ℤ → N ⋅ M + A mod M = A mod M

Proof

Step Hyp Ref Expression
1 zre ⊢ N ∈ ℤ → N ∈ ℝ
2 1 3ad2ant3 ⊢ A ∈ ℝ ∧ M ∈ ℝ + ∧ N ∈ ℤ → N ∈ ℝ
3 rpre ⊢ M ∈ ℝ + → M ∈ ℝ
4 3 3ad2ant2 ⊢ A ∈ ℝ ∧ M ∈ ℝ + ∧ N ∈ ℤ → M ∈ ℝ
5 2 4 remulcld ⊢ A ∈ ℝ ∧ M ∈ ℝ + ∧ N ∈ ℤ → N ⋅ M ∈ ℝ
6 simp1 ⊢ A ∈ ℝ ∧ M ∈ ℝ + ∧ N ∈ ℤ → A ∈ ℝ
7 simp2 ⊢ A ∈ ℝ ∧ M ∈ ℝ + ∧ N ∈ ℤ → M ∈ ℝ +
8 modaddmod ⊢ N ⋅ M ∈ ℝ ∧ A ∈ ℝ ∧ M ∈ ℝ + → N ⋅ M mod M + A mod M = N ⋅ M + A mod M
9 5 6 7 8 syl3anc ⊢ A ∈ ℝ ∧ M ∈ ℝ + ∧ N ∈ ℤ → N ⋅ M mod M + A mod M = N ⋅ M + A mod M
10 pm3.22 ⊢ M ∈ ℝ + ∧ N ∈ ℤ → N ∈ ℤ ∧ M ∈ ℝ +
11 10 3adant1 ⊢ A ∈ ℝ ∧ M ∈ ℝ + ∧ N ∈ ℤ → N ∈ ℤ ∧ M ∈ ℝ +
12 mulmod0 ⊢ N ∈ ℤ ∧ M ∈ ℝ + → N ⋅ M mod M = 0
13 11 12 syl ⊢ A ∈ ℝ ∧ M ∈ ℝ + ∧ N ∈ ℤ → N ⋅ M mod M = 0
14 13 oveq1d ⊢ A ∈ ℝ ∧ M ∈ ℝ + ∧ N ∈ ℤ → N ⋅ M mod M + A = 0 + A
15 recn ⊢ A ∈ ℝ → A ∈ ℂ
16 15 addlidd ⊢ A ∈ ℝ → 0 + A = A
17 16 3ad2ant1 ⊢ A ∈ ℝ ∧ M ∈ ℝ + ∧ N ∈ ℤ → 0 + A = A
18 14 17 eqtrd ⊢ A ∈ ℝ ∧ M ∈ ℝ + ∧ N ∈ ℤ → N ⋅ M mod M + A = A
19 18 oveq1d ⊢ A ∈ ℝ ∧ M ∈ ℝ + ∧ N ∈ ℤ → N ⋅ M mod M + A mod M = A mod M
20 9 19 eqtr3d ⊢ A ∈ ℝ ∧ M ∈ ℝ + ∧ N ∈ ℤ → N ⋅ M + A mod M = A mod M