Metamath Proof Explorer


Theorem modaddabs

Description: Absorption law for modulo. (Contributed by Paul Chapman, 22-Jun-2011)

Ref Expression
Assertion modaddabs ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ + → A mod C + B mod C mod C = A + B mod C

Proof

Step Hyp Ref Expression
1 modcl ⊢ A ∈ ℝ ∧ C ∈ ℝ + → A mod C ∈ ℝ
2 1 recnd ⊢ A ∈ ℝ ∧ C ∈ ℝ + → A mod C ∈ ℂ
3 2 3adant2 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ + → A mod C ∈ ℂ
4 modcl ⊢ B ∈ ℝ ∧ C ∈ ℝ + → B mod C ∈ ℝ
5 4 recnd ⊢ B ∈ ℝ ∧ C ∈ ℝ + → B mod C ∈ ℂ
6 5 3adant1 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ + → B mod C ∈ ℂ
7 3 6 addcomd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ + → A mod C + B mod C = B mod C + A mod C
8 7 oveq1d ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ + → A mod C + B mod C mod C = B mod C + A mod C mod C
9 simpl ⊢ B ∈ ℝ ∧ C ∈ ℝ + → B ∈ ℝ
10 4 9 jca ⊢ B ∈ ℝ ∧ C ∈ ℝ + → B mod C ∈ ℝ ∧ B ∈ ℝ
11 10 3adant1 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ + → B mod C ∈ ℝ ∧ B ∈ ℝ
12 simpr ⊢ A ∈ ℝ ∧ C ∈ ℝ + → C ∈ ℝ +
13 1 12 jca ⊢ A ∈ ℝ ∧ C ∈ ℝ + → A mod C ∈ ℝ ∧ C ∈ ℝ +
14 13 3adant2 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ + → A mod C ∈ ℝ ∧ C ∈ ℝ +
15 modabs2 ⊢ B ∈ ℝ ∧ C ∈ ℝ + → B mod C mod C = B mod C
16 15 3adant1 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ + → B mod C mod C = B mod C
17 modadd1 ⊢ B mod C ∈ ℝ ∧ B ∈ ℝ ∧ A mod C ∈ ℝ ∧ C ∈ ℝ + ∧ B mod C mod C = B mod C → B mod C + A mod C mod C = B + A mod C mod C
18 11 14 16 17 syl3anc ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ + → B mod C + A mod C mod C = B + A mod C mod C
19 recn ⊢ B ∈ ℝ → B ∈ ℂ
20 19 3ad2ant2 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ + → B ∈ ℂ
21 3 20 addcomd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ + → A mod C + B = B + A mod C
22 21 oveq1d ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ + → A mod C + B mod C = B + A mod C mod C
23 18 22 eqtr4d ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ + → B mod C + A mod C mod C = A mod C + B mod C
24 simpl ⊢ A ∈ ℝ ∧ C ∈ ℝ + → A ∈ ℝ
25 1 24 jca ⊢ A ∈ ℝ ∧ C ∈ ℝ + → A mod C ∈ ℝ ∧ A ∈ ℝ
26 25 3adant2 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ + → A mod C ∈ ℝ ∧ A ∈ ℝ
27 3simpc ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ + → B ∈ ℝ ∧ C ∈ ℝ +
28 modabs2 ⊢ A ∈ ℝ ∧ C ∈ ℝ + → A mod C mod C = A mod C
29 28 3adant2 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ + → A mod C mod C = A mod C
30 modadd1 ⊢ A mod C ∈ ℝ ∧ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ + ∧ A mod C mod C = A mod C → A mod C + B mod C = A + B mod C
31 26 27 29 30 syl3anc ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ + → A mod C + B mod C = A + B mod C
32 8 23 31 3eqtrd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ + → A mod C + B mod C mod C = A + B mod C