nat.not_le_Sn_n
∀ n, ¬((n+1) ≤ n)
Theorem not_le_Sn_n : forall (n:nat), connectives.Not (le (S n) n).
theorem not_le_Sn_n : \forall (n:nat). (Not) ((le) ((S) n) n).
theorem not_le_Sn_n : forall (n:nat.nat) , ((connectives.Not) ) ((((nat.le_) ) (((nat.S) ) (n))) (n)).
not_le_Sn_n : LEMMA (FORALL(n:nat_sttfa.sttfa_nat):connectives_sttfa_th.sttfa_Not(nat_sttfa.le(nat_sttfa.sttfa_S(n))(n)))
Printing for OpenTheory is not working at the moment.