Database
SUPPLEMENTARY MATERIAL (USERS' MATHBOXES)
Mathbox for Owen Orger
ltleaddtri
Metamath Proof Explorer
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
⊢ 𝐴 ∈ ℝ
ltleaddtri.2
⊢ 𝐵 ∈ ℝ
ltleaddtri.3
⊢ 𝐶 ∈ ℝ
ltleaddtri.4
⊢ 𝐷 ∈ ℝ
ltleaddtri.5
⊢ 𝐴 < 𝐵
ltleaddtri.6
⊢ 𝐵 ≤ 𝐶
Assertion
ltleaddtri
⊢ ( 𝐴 + 𝐷 ) < ( 𝐶 + 𝐷 )
Proof
Step
Hyp
Ref
Expression
1
ltleaddtri.1
⊢ 𝐴 ∈ ℝ
2
ltleaddtri.2
⊢ 𝐵 ∈ ℝ
3
ltleaddtri.3
⊢ 𝐶 ∈ ℝ
4
ltleaddtri.4
⊢ 𝐷 ∈ ℝ
5
ltleaddtri.5
⊢ 𝐴 < 𝐵
6
ltleaddtri.6
⊢ 𝐵 ≤ 𝐶
7
1 2 3
ltletri
⊢ ( ( 𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶 ) → 𝐴 < 𝐶 )
8
5 6 7
mp2an
⊢ 𝐴 < 𝐶
9
1 3 4
ltadd1i
⊢ ( 𝐴 < 𝐶 ↔ ( 𝐴 + 𝐷 ) < ( 𝐶 + 𝐷 ) )
10
8 9
mpbi
⊢ ( 𝐴 + 𝐷 ) < ( 𝐶 + 𝐷 )