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 e. RR
3letri.2
|- B e. RR
3letri.3
|- C e. RR
3letri.4
|- D e. RR
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 e. RR
2 3letri.2
 |-  B e. RR
3 3letri.3
 |-  C e. RR
4 3letri.4
 |-  D e. RR
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