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

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

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

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

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

Printing for OpenTheory is not working at the moment.