Metamath Proof Explorer


Theorem modabs

Description: Absorption law for modulo. (Contributed by NM, 29-Dec-2008)

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

Proof

Step Hyp Ref Expression
1 modcl ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A mod B ∈ ℝ
2 1 anim1i ⊢ A ∈ ℝ ∧ B ∈ ℝ + ∧ C ∈ ℝ + → A mod B ∈ ℝ ∧ C ∈ ℝ +
3 2 3impa ⊢ A ∈ ℝ ∧ B ∈ ℝ + ∧ C ∈ ℝ + → A mod B ∈ ℝ ∧ C ∈ ℝ +
4 3 adantr ⊢ A ∈ ℝ ∧ B ∈ ℝ + ∧ C ∈ ℝ + ∧ B ≤ C → A mod B ∈ ℝ ∧ C ∈ ℝ +
5 modge0 ⊢ A ∈ ℝ ∧ B ∈ ℝ + → 0 ≤ A mod B
6 5 3adant3 ⊢ A ∈ ℝ ∧ B ∈ ℝ + ∧ C ∈ ℝ + → 0 ≤ A mod B
7 6 adantr ⊢ A ∈ ℝ ∧ B ∈ ℝ + ∧ C ∈ ℝ + ∧ B ≤ C → 0 ≤ A mod B
8 1 3adant3 ⊢ A ∈ ℝ ∧ B ∈ ℝ + ∧ C ∈ ℝ + → A mod B ∈ ℝ
9 8 adantr ⊢ A ∈ ℝ ∧ B ∈ ℝ + ∧ C ∈ ℝ + ∧ B ≤ C → A mod B ∈ ℝ
10 rpre ⊢ B ∈ ℝ + → B ∈ ℝ
11 10 3ad2ant2 ⊢ A ∈ ℝ ∧ B ∈ ℝ + ∧ C ∈ ℝ + → B ∈ ℝ
12 11 adantr ⊢ A ∈ ℝ ∧ B ∈ ℝ + ∧ C ∈ ℝ + ∧ B ≤ C → B ∈ ℝ
13 rpre ⊢ C ∈ ℝ + → C ∈ ℝ
14 13 3ad2ant3 ⊢ A ∈ ℝ ∧ B ∈ ℝ + ∧ C ∈ ℝ + → C ∈ ℝ
15 14 adantr ⊢ A ∈ ℝ ∧ B ∈ ℝ + ∧ C ∈ ℝ + ∧ B ≤ C → C ∈ ℝ
16 modlt ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A mod B < B
17 16 3adant3 ⊢ A ∈ ℝ ∧ B ∈ ℝ + ∧ C ∈ ℝ + → A mod B < B
18 17 adantr ⊢ A ∈ ℝ ∧ B ∈ ℝ + ∧ C ∈ ℝ + ∧ B ≤ C → A mod B < B
19 simpr ⊢ A ∈ ℝ ∧ B ∈ ℝ + ∧ C ∈ ℝ + ∧ B ≤ C → B ≤ C
20 9 12 15 18 19 ltletrd ⊢ A ∈ ℝ ∧ B ∈ ℝ + ∧ C ∈ ℝ + ∧ B ≤ C → A mod B < C
21 modid ⊢ A mod B ∈ ℝ ∧ C ∈ ℝ + ∧ 0 ≤ A mod B ∧ A mod B < C → A mod B mod C = A mod B
22 4 7 20 21 syl12anc ⊢ A ∈ ℝ ∧ B ∈ ℝ + ∧ C ∈ ℝ + ∧ B ≤ C → A mod B mod C = A mod B