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 ⊢ 𝐴 ∈ ℝ
3letri.2 ⊢ 𝐵 ∈ ℝ
3letri.3 ⊢ 𝐶 ∈ ℝ
3letri.4 ⊢ 𝐷 ∈ ℝ
3letri.5 ⊢ 𝐴 ≤ 𝐵
3letri.6 ⊢ 𝐵 ≤ 𝐶
3letri.7 ⊢ 𝐶 ≤ 𝐷
Assertion 3letri 𝐴 ≤ 𝐷

Proof

Step Hyp Ref Expression
1 3letri.1 ⊢ 𝐴 ∈ ℝ
2 3letri.2 ⊢ 𝐵 ∈ ℝ
3 3letri.3 ⊢ 𝐶 ∈ ℝ
4 3letri.4 ⊢ 𝐷 ∈ ℝ
5 3letri.5 ⊢ 𝐴 ≤ 𝐵
6 3letri.6 ⊢ 𝐵 ≤ 𝐶
7 3letri.7 ⊢ 𝐶 ≤ 𝐷
8 1 2 3 letri ⊢ ( ( 𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶 ) → 𝐴 ≤ 𝐶 )
9 5 6 8 mp2an ⊢ 𝐴 ≤ 𝐶
10 1 3 4 letri ⊢ ( ( 𝐴 ≤ 𝐶 ∧ 𝐶 ≤ 𝐷 ) → 𝐴 ≤ 𝐷 )
11 9 7 10 mp2an ⊢ 𝐴 ≤ 𝐷