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 ⊢ 𝐴 ∈ ℝ
ltletrnei.2 ⊢ 𝐵 ∈ ℝ
ltletrnei.3 ⊢ 𝐶 ∈ ℝ
ltletrnei.4 ⊢ 𝐴 < 𝐵
ltletrnei.5 ⊢ 𝐵 ≤ 𝐶
Assertion ltletrnei 𝐴 ≠ 𝐶

Proof

Step Hyp Ref Expression
1 ltletrnei.1 ⊢ 𝐴 ∈ ℝ
2 ltletrnei.2 ⊢ 𝐵 ∈ ℝ
3 ltletrnei.3 ⊢ 𝐶 ∈ ℝ
4 ltletrnei.4 ⊢ 𝐴 < 𝐵
5 ltletrnei.5 ⊢ 𝐵 ≤ 𝐶
6 1 2 3 ltletri ⊢ ( ( 𝐴 < 𝐵 ∧ 𝐵 ≤ 𝐶 ) → 𝐴 < 𝐶 )
7 4 5 6 mp2an ⊢ 𝐴 < 𝐶
8 1 7 ltneii ⊢ 𝐴 ≠ 𝐶