Metamath Proof Explorer


Theorem lenlti

Description: 'Less than or equal to' in terms of 'less than'. (Contributed by NM, 24-May-1999)

Ref Expression
Hypotheses lt.1 𝐴 ∈ ℝ
lt.2 𝐵 ∈ ℝ
Assertion lenlti ( 𝐴𝐵 ↔ ¬ 𝐵 < 𝐴 )

Proof

Step Hyp Ref Expression
1 lt.1 𝐴 ∈ ℝ
2 lt.2 𝐵 ∈ ℝ
3 lenlt ( ( 𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ) → ( 𝐴𝐵 ↔ ¬ 𝐵 < 𝐴 ) )
4 1 2 3 mp2an ( 𝐴𝐵 ↔ ¬ 𝐵 < 𝐴 )