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 ∈ ℝ
ltletrnei.2 ⊢ B ∈ ℝ
ltletrnei.3 ⊢ C ∈ ℝ
ltletrnei.4 ⊢ A < B
ltletrnei.5 ⊢ B ≤ C
Assertion ltletrnei ⊢ A ≠ C

Proof

Step Hyp Ref Expression
1 ltletrnei.1 ⊢ A ∈ ℝ
2 ltletrnei.2 ⊢ B ∈ ℝ
3 ltletrnei.3 ⊢ C ∈ ℝ
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