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 e. RR
ltleaddtri.2
|- B e. RR
ltleaddtri.3
|- C e. RR
ltleaddtri.4
|- D e. RR
ltleaddtri.5
|- A < B
ltleaddtri.6
|- B <_ C
Assertion ltleaddtri
|- ( A + D ) < ( C + D )

Proof

Step Hyp Ref Expression
1 ltleaddtri.1
 |-  A e. RR
2 ltleaddtri.2
 |-  B e. RR
3 ltleaddtri.3
 |-  C e. RR
4 ltleaddtri.4
 |-  D e. RR
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 )