Metamath Proof Explorer


Theorem ltleaddtri

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

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

Proof

Step Hyp Ref Expression
1 ltleaddtri.1 ⊢ A ∈ ℝ
2 ltleaddtri.2 ⊢ B ∈ ℝ
3 ltleaddtri.3 ⊢ C ∈ ℝ
4 ltleaddtri.4 ⊢ D ∈ ℝ
5 ltleaddtri.5 ⊢ A < B
6 ltleaddtri.6 ⊢ B ≤ C
7 1 2 3 ltletri ⊢ 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