Metamath Proof Explorer


Theorem ltletrnei

Description: The endpoints of a strict then non-strict inequality chain are unequal. Proof prepared with AI assistance from OpenAI Codex. (Contributed by Owen Orger, 11-Nov-2026)

Ref Expression
Hypotheses ltletrnei.1
|- A e. RR
ltletrnei.2
|- B e. RR
ltletrnei.3
|- C e. RR
ltletrnei.4
|- A < B
ltletrnei.5
|- B <_ C
Assertion ltletrnei
|- A =/= C

Proof

Step Hyp Ref Expression
1 ltletrnei.1
 |-  A e. RR
2 ltletrnei.2
 |-  B e. RR
3 ltletrnei.3
 |-  C e. RR
4 ltletrnei.4
 |-  A < B
5 ltletrnei.5
 |-  B <_ C
6 1 2 3 ltletri
 |-  ( ( A < B /\ B <_ C ) -> A < C )
7 4 5 6 mp2an
 |-  A < C
8 1 7 ltneii
 |-  A =/= C