Metamath Proof Explorer


Theorem letrsubge0i

Description: The difference of the endpoints of a non-strict inequality chain is nonnegative. Proof prepared with AI assistance from OpenAI Codex. (Contributed by Owen Orger, 11-Nov-2026)

Ref Expression
Hypotheses letrsubge0i.1 ⊢ 𝐴 ∈ ℝ
letrsubge0i.2 ⊢ 𝐵 ∈ ℝ
letrsubge0i.3 ⊢ 𝐶 ∈ ℝ
letrsubge0i.4 ⊢ 𝐴 ≤ 𝐵
letrsubge0i.5 ⊢ 𝐵 ≤ 𝐶
Assertion letrsubge0i 0 ≤ ( 𝐶 − 𝐴 )

Proof

Step Hyp Ref Expression
1 letrsubge0i.1 ⊢ 𝐴 ∈ ℝ
2 letrsubge0i.2 ⊢ 𝐵 ∈ ℝ
3 letrsubge0i.3 ⊢ 𝐶 ∈ ℝ
4 letrsubge0i.4 ⊢ 𝐴 ≤ 𝐵
5 letrsubge0i.5 ⊢ 𝐵 ≤ 𝐶
6 1 2 3 letri ⊢ ( ( 𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶 ) → 𝐴 ≤ 𝐶 )
7 4 5 6 mp2an ⊢ 𝐴 ≤ 𝐶
8 3 1 subge0i ⊢ ( 0 ≤ ( 𝐶 − 𝐴 ) ↔ 𝐴 ≤ 𝐶 )
9 7 8 mpbir ⊢ 0 ≤ ( 𝐶 − 𝐴 )