∀ n m, n ≤ m ⇒ (n < m) ∨ (n = m)

Theorem le_to_or_lt_eq : forall (n:nat), forall (m:nat), (le n m) -> connectives.Or (lt n m) (logic.eq (nat) n m).

theorem le_to_or_lt_eq : \forall (n:nat). \forall (m:nat). ((le) n m) -> (Or) ((lt) n m) ((eq) (nat) n m).

theorem le_to_or_lt_eq : forall (n:nat.nat) , forall (m:nat.nat) , ((((nat.le_) ) (n)) (m)) -> (((connectives.Or) ) ((((nat.lt_) ) (n)) (m))) ((((logic.eq_) (nat.nat)) (n)) (m)).

le_to_or_lt_eq : LEMMA (FORALL(n:nat_sttfa.sttfa_nat):(FORALL(m:nat_sttfa.sttfa_nat):(nat_sttfa.le(n)(m) => connectives_sttfa_th.sttfa_Or(nat_sttfa.lt(n)(m))(logic_sttfa_th.eq[nat_sttfa.sttfa_nat](n)(m)))))

Printing for OpenTheory is not working at the moment.