Description: Translate a non-strict then 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 | leltaddtri.1 | |- A e. RR |
|
| leltaddtri.2 | |- B e. RR |
||
| leltaddtri.3 | |- C e. RR |
||
| leltaddtri.4 | |- D e. RR |
||
| leltaddtri.5 | |- A <_ B |
||
| leltaddtri.6 | |- B < C |
||
| Assertion | leltaddtri | |- ( A + D ) < ( C + D ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | leltaddtri.1 | |- A e. RR |
|
| 2 | leltaddtri.2 | |- B e. RR |
|
| 3 | leltaddtri.3 | |- C e. RR |
|
| 4 | leltaddtri.4 | |- D e. RR |
|
| 5 | leltaddtri.5 | |- A <_ B |
|
| 6 | leltaddtri.6 | |- B < C |
|
| 7 | 1 2 3 | lelttri | |- ( ( 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 ) |