Metamath Proof Explorer


Theorem modltm1p1mod

Description: If a real number modulo a positive real number is less than the positive real number decreased by 1, the real number increased by 1 modulo the positive real number equals the real number modulo the positive real number increased by 1. (Contributed by AV, 2-Nov-2018)

Ref Expression
Assertion modltm1p1mod ⊢ A ∈ ℝ ∧ M ∈ ℝ + ∧ A mod M < M − 1 → A + 1 mod M = A mod M + 1

Proof

Step Hyp Ref Expression
1 simpl ⊢ A ∈ ℝ ∧ M ∈ ℝ + → A ∈ ℝ
2 1red ⊢ A ∈ ℝ ∧ M ∈ ℝ + → 1 ∈ ℝ
3 simpr ⊢ A ∈ ℝ ∧ M ∈ ℝ + → M ∈ ℝ +
4 1 2 3 3jca ⊢ A ∈ ℝ ∧ M ∈ ℝ + → A ∈ ℝ ∧ 1 ∈ ℝ ∧ M ∈ ℝ +
5 4 3adant3 ⊢ A ∈ ℝ ∧ M ∈ ℝ + ∧ A mod M < M − 1 → A ∈ ℝ ∧ 1 ∈ ℝ ∧ M ∈ ℝ +
6 modaddmod ⊢ A ∈ ℝ ∧ 1 ∈ ℝ ∧ M ∈ ℝ + → A mod M + 1 mod M = A + 1 mod M
7 5 6 syl ⊢ A ∈ ℝ ∧ M ∈ ℝ + ∧ A mod M < M − 1 → A mod M + 1 mod M = A + 1 mod M
8 modcl ⊢ A ∈ ℝ ∧ M ∈ ℝ + → A mod M ∈ ℝ
9 peano2re ⊢ A mod M ∈ ℝ → A mod M + 1 ∈ ℝ
10 8 9 syl ⊢ A ∈ ℝ ∧ M ∈ ℝ + → A mod M + 1 ∈ ℝ
11 10 3 jca ⊢ A ∈ ℝ ∧ M ∈ ℝ + → A mod M + 1 ∈ ℝ ∧ M ∈ ℝ +
12 11 3adant3 ⊢ A ∈ ℝ ∧ M ∈ ℝ + ∧ A mod M < M − 1 → A mod M + 1 ∈ ℝ ∧ M ∈ ℝ +
13 0red ⊢ A ∈ ℝ ∧ M ∈ ℝ + → 0 ∈ ℝ
14 modge0 ⊢ A ∈ ℝ ∧ M ∈ ℝ + → 0 ≤ A mod M
15 8 lep1d ⊢ A ∈ ℝ ∧ M ∈ ℝ + → A mod M ≤ A mod M + 1
16 13 8 10 14 15 letrd ⊢ A ∈ ℝ ∧ M ∈ ℝ + → 0 ≤ A mod M + 1
17 16 3adant3 ⊢ A ∈ ℝ ∧ M ∈ ℝ + ∧ A mod M < M − 1 → 0 ≤ A mod M + 1
18 rpre ⊢ M ∈ ℝ + → M ∈ ℝ
19 18 adantl ⊢ A ∈ ℝ ∧ M ∈ ℝ + → M ∈ ℝ
20 8 2 19 ltaddsubd ⊢ A ∈ ℝ ∧ M ∈ ℝ + → A mod M + 1 < M ↔ A mod M < M − 1
21 20 biimp3ar ⊢ A ∈ ℝ ∧ M ∈ ℝ + ∧ A mod M < M − 1 → A mod M + 1 < M
22 modid ⊢ A mod M + 1 ∈ ℝ ∧ M ∈ ℝ + ∧ 0 ≤ A mod M + 1 ∧ A mod M + 1 < M → A mod M + 1 mod M = A mod M + 1
23 12 17 21 22 syl12anc ⊢ A ∈ ℝ ∧ M ∈ ℝ + ∧ A mod M < M − 1 → A mod M + 1 mod M = A mod M + 1
24 7 23 eqtr3d ⊢ A ∈ ℝ ∧ M ∈ ℝ + ∧ A mod M < M − 1 → A + 1 mod M = A mod M + 1