Metamath Proof Explorer


Theorem 3letri

Description: Transitivity along three consecutive non-strict inequalities of real numbers. Proof prepared with AI assistance from OpenAI Codex. (Contributed by Owen Orger, 11-Nov-2026)

Ref Expression
Hypotheses 3letri.1 ⊢ A ∈ ℝ
3letri.2 ⊢ B ∈ ℝ
3letri.3 ⊢ C ∈ ℝ
3letri.4 ⊢ D ∈ ℝ
3letri.5 ⊢ A ≤ B
3letri.6 ⊢ B ≤ C
3letri.7 ⊢ C ≤ D
Assertion 3letri ⊢ A ≤ D

Proof

Step Hyp Ref Expression
1 3letri.1 ⊢ A ∈ ℝ
2 3letri.2 ⊢ B ∈ ℝ
3 3letri.3 ⊢ C ∈ ℝ
4 3letri.4 ⊢ D ∈ ℝ
5 3letri.5 ⊢ A ≤ B
6 3letri.6 ⊢ B ≤ C
7 3letri.7 ⊢ C ≤ D
8 1 2 3 letri ⊢ A ≤ B ∧ B ≤ C → A ≤ C
9 5 6 8 mp2an ⊢ A ≤ C
10 1 3 4 letri ⊢ A ≤ C ∧ C ≤ D → A ≤ D
11 9 7 10 mp2an ⊢ A ≤ D