∀ n m, n < m ⇒ ¬(m ≤ n)

Theorem lt_to_not_le : forall (n:nat), forall (m:nat), (lt n m) -> connectives.Not (le m n).

theorem lt_to_not_le : \forall (n:nat). \forall (m:nat). ((lt) n m) -> (Not) ((le) m n).

theorem lt_to_not_le : forall (n:nat.nat) , forall (m:nat.nat) , ((((nat.lt_) ) (n)) (m)) -> ((connectives.Not) ) ((((nat.le_) ) (m)) (n)).

lt_to_not_le : LEMMA (FORALL(n:nat_sttfa.sttfa_nat):(FORALL(m:nat_sttfa.sttfa_nat):(nat_sttfa.lt(n)(m) => connectives_sttfa_th.sttfa_Not(nat_sttfa.le(m)(n)))))

Printing for OpenTheory is not working at the moment.