Metamath Proof Explorer


Theorem 3letrd

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

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

Proof

Step Hyp Ref Expression
1 3letrd.1 ⊢ φ → A ∈ ℝ
2 3letrd.2 ⊢ φ → B ∈ ℝ
3 3letrd.3 ⊢ φ → C ∈ ℝ
4 3letrd.4 ⊢ φ → D ∈ ℝ
5 3letrd.5 ⊢ φ → A ≤ B
6 3letrd.6 ⊢ φ → B ≤ C
7 3letrd.7 ⊢ φ → C ≤ D
8 1 2 3 5 6 letrd ⊢ φ → A ≤ C
9 1 3 4 8 7 letrd ⊢ φ → A ≤ D