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 ⊢ ( 𝜑 → 𝐴 ∈ ℝ )
3letrd.2 ⊢ ( 𝜑 → 𝐵 ∈ ℝ )
3letrd.3 ⊢ ( 𝜑 → 𝐶 ∈ ℝ )
3letrd.4 ⊢ ( 𝜑 → 𝐷 ∈ ℝ )
3letrd.5 ⊢ ( 𝜑 → 𝐴 ≤ 𝐵 )
3letrd.6 ⊢ ( 𝜑 → 𝐵 ≤ 𝐶 )
3letrd.7 ⊢ ( 𝜑 → 𝐶 ≤ 𝐷 )
Assertion 3letrd ( 𝜑 → 𝐴 ≤ 𝐷 )

Proof

Step Hyp Ref Expression
1 3letrd.1 ⊢ ( 𝜑 → 𝐴 ∈ ℝ )
2 3letrd.2 ⊢ ( 𝜑 → 𝐵 ∈ ℝ )
3 3letrd.3 ⊢ ( 𝜑 → 𝐶 ∈ ℝ )
4 3letrd.4 ⊢ ( 𝜑 → 𝐷 ∈ ℝ )
5 3letrd.5 ⊢ ( 𝜑 → 𝐴 ≤ 𝐵 )
6 3letrd.6 ⊢ ( 𝜑 → 𝐵 ≤ 𝐶 )
7 3letrd.7 ⊢ ( 𝜑 → 𝐶 ≤ 𝐷 )
8 1 2 3 5 6 letrd ⊢ ( 𝜑 → 𝐴 ≤ 𝐶 )
9 1 3 4 8 7 letrd ⊢ ( 𝜑 → 𝐴 ≤ 𝐷 )