∀ n m, (n+1) ≤ (m+1) ⇒ n ≤ m

Theorem le_S_S_to_le : forall (n:nat), forall (m:nat), (le (S n) (S m)) -> le n m.

theorem le_S_S_to_le : \forall (n:nat). \forall (m:nat). ((le) ((S) n) ((S) m)) -> (le) n m.

theorem le_S_S_to_le : forall (n:nat.nat) , forall (m:nat.nat) , ((((nat.le_) ) (((nat.S) ) (n))) (((nat.S) ) (m))) -> (((nat.le_) ) (n)) (m).

le_S_S_to_le : LEMMA (FORALL(n:nat_sttfa.sttfa_nat):(FORALL(m:nat_sttfa.sttfa_nat):(nat_sttfa.le(nat_sttfa.sttfa_S(n))(nat_sttfa.sttfa_S(m)) => nat_sttfa.le(n)(m))))

Printing for OpenTheory is not working at the moment.