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