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

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

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

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

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

Printing for OpenTheory is not working at the moment.