Metamath Proof Explorer


Theorem modaddb

Description: Addition property of the modulo operation. Biconditional version of modadd1 by applying modadd1 twice. (Contributed by AV, 14-Nov-2025)

Ref Expression
Assertion modaddb ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ D ∈ ℝ + → A mod D = B mod D ↔ A + C mod D = B + C mod D

Proof

Step Hyp Ref Expression
1 modadd1 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ D ∈ ℝ + ∧ A mod D = B mod D → A + C mod D = B + C mod D
2 1 3expa ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ D ∈ ℝ + ∧ A mod D = B mod D → A + C mod D = B + C mod D
3 simpll ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ D ∈ ℝ + → A ∈ ℝ
4 simprl ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ D ∈ ℝ + → C ∈ ℝ
5 3 4 readdcld ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ D ∈ ℝ + → A + C ∈ ℝ
6 simplr ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ D ∈ ℝ + → B ∈ ℝ
7 6 4 readdcld ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ D ∈ ℝ + → B + C ∈ ℝ
8 5 7 jca ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ D ∈ ℝ + → A + C ∈ ℝ ∧ B + C ∈ ℝ
9 8 adantr ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ D ∈ ℝ + ∧ A + C mod D = B + C mod D → A + C ∈ ℝ ∧ B + C ∈ ℝ
10 renegcl ⊢ C ∈ ℝ → − C ∈ ℝ
11 10 anim1i ⊢ C ∈ ℝ ∧ D ∈ ℝ + → − C ∈ ℝ ∧ D ∈ ℝ +
12 11 adantl ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ D ∈ ℝ + → − C ∈ ℝ ∧ D ∈ ℝ +
13 12 adantr ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ D ∈ ℝ + ∧ A + C mod D = B + C mod D → − C ∈ ℝ ∧ D ∈ ℝ +
14 simpr ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ D ∈ ℝ + ∧ A + C mod D = B + C mod D → A + C mod D = B + C mod D
15 modadd1 ⊢ A + C ∈ ℝ ∧ B + C ∈ ℝ ∧ − C ∈ ℝ ∧ D ∈ ℝ + ∧ A + C mod D = B + C mod D → A + C + − C mod D = B + C + − C mod D
16 9 13 14 15 syl3anc ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ D ∈ ℝ + ∧ A + C mod D = B + C mod D → A + C + − C mod D = B + C + − C mod D
17 simpl ⊢ A ∈ ℝ ∧ B ∈ ℝ → A ∈ ℝ
18 17 recnd ⊢ A ∈ ℝ ∧ B ∈ ℝ → A ∈ ℂ
19 18 adantr ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ D ∈ ℝ + → A ∈ ℂ
20 simpl ⊢ C ∈ ℝ ∧ D ∈ ℝ + → C ∈ ℝ
21 20 recnd ⊢ C ∈ ℝ ∧ D ∈ ℝ + → C ∈ ℂ
22 21 adantl ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ D ∈ ℝ + → C ∈ ℂ
23 19 22 addcld ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ D ∈ ℝ + → A + C ∈ ℂ
24 23 22 negsubd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ D ∈ ℝ + → A + C + − C = A + C - C
25 19 22 pncand ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ D ∈ ℝ + → A + C - C = A
26 24 25 eqtr2d ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ D ∈ ℝ + → A = A + C + − C
27 26 oveq1d ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ D ∈ ℝ + → A mod D = A + C + − C mod D
28 simpr ⊢ A ∈ ℝ ∧ B ∈ ℝ → B ∈ ℝ
29 28 recnd ⊢ A ∈ ℝ ∧ B ∈ ℝ → B ∈ ℂ
30 29 adantr ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ D ∈ ℝ + → B ∈ ℂ
31 30 22 addcld ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ D ∈ ℝ + → B + C ∈ ℂ
32 31 22 negsubd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ D ∈ ℝ + → B + C + − C = B + C - C
33 30 22 pncand ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ D ∈ ℝ + → B + C - C = B
34 32 33 eqtr2d ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ D ∈ ℝ + → B = B + C + − C
35 34 oveq1d ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ D ∈ ℝ + → B mod D = B + C + − C mod D
36 27 35 eqeq12d ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ D ∈ ℝ + → A mod D = B mod D ↔ A + C + − C mod D = B + C + − C mod D
37 36 adantr ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ D ∈ ℝ + ∧ A + C mod D = B + C mod D → A mod D = B mod D ↔ A + C + − C mod D = B + C + − C mod D
38 16 37 mpbird ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ D ∈ ℝ + ∧ A + C mod D = B + C mod D → A mod D = B mod D
39 2 38 impbida ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ D ∈ ℝ + → A mod D = B mod D ↔ A + C mod D = B + C mod D