Metamath Proof Explorer


Theorem 2ltaddtri

Description: Translate a chain of two strict inequalities by a real number. Proof prepared with AI assistance from OpenAI Codex. (Contributed by Owen Orger, 11-Nov-2026)

Ref Expression
Hypotheses 2ltaddtri.1 ⊢ A ∈ ℝ
2ltaddtri.2 ⊢ B ∈ ℝ
2ltaddtri.3 ⊢ C ∈ ℝ
2ltaddtri.4 ⊢ D ∈ ℝ
2ltaddtri.5 ⊢ A < B
2ltaddtri.6 ⊢ B < C
Assertion 2ltaddtri ⊢ A + D < C + D

Proof

Step Hyp Ref Expression
1 2ltaddtri.1 ⊢ A ∈ ℝ
2 2ltaddtri.2 ⊢ B ∈ ℝ
3 2ltaddtri.3 ⊢ C ∈ ℝ
4 2ltaddtri.4 ⊢ D ∈ ℝ
5 2ltaddtri.5 ⊢ A < B
6 2ltaddtri.6 ⊢ B < C
7 1 2 3 lttri ⊢ A < B ∧ B < C → A < C
8 5 6 7 mp2an ⊢ A < C
9 1 3 4 ltadd1i ⊢ A < C ↔ A + D < C + D
10 8 9 mpbi ⊢ A + D < C + D