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
|- ( ph -> A e. RR )
3letrd.2
|- ( ph -> B e. RR )
3letrd.3
|- ( ph -> C e. RR )
3letrd.4
|- ( ph -> D e. RR )
3letrd.5
|- ( ph -> A <_ B )
3letrd.6
|- ( ph -> B <_ C )
3letrd.7
|- ( ph -> C <_ D )
Assertion 3letrd
|- ( ph -> A <_ D )

Proof

Step Hyp Ref Expression
1 3letrd.1
 |-  ( ph -> A e. RR )
2 3letrd.2
 |-  ( ph -> B e. RR )
3 3letrd.3
 |-  ( ph -> C e. RR )
4 3letrd.4
 |-  ( ph -> D e. RR )
5 3letrd.5
 |-  ( ph -> A <_ B )
6 3letrd.6
 |-  ( ph -> B <_ C )
7 3letrd.7
 |-  ( ph -> C <_ D )
8 1 2 3 5 6 letrd
 |-  ( ph -> A <_ C )
9 1 3 4 8 7 letrd
 |-  ( ph -> A <_ D )