∀ n, ¬((n+1) ≤ O)

Theorem not_le_Sn_O : forall (n:nat), connectives.Not (le (S n) O).

theorem not_le_Sn_O : \forall (n:nat). (Not) ((le) ((S) n) (O) ).

theorem not_le_Sn_O : forall (n:nat.nat) , ((connectives.Not) ) ((((nat.le_) ) (((nat.S) ) (n))) ((nat.O) )).

not_le_Sn_O : LEMMA (FORALL(n:nat_sttfa.sttfa_nat):connectives_sttfa_th.sttfa_Not(nat_sttfa.le(nat_sttfa.sttfa_S(n))(nat_sttfa.sttfa_O)))

Printing for OpenTheory is not working at the moment.