proposition: Lemma natlehsminus ( n m : nat ) : natleh ( sub ( S n ) m ) ( S (sub n m ) ).
proof: Proof. revert m. induction n. - intros m. apply negnatgthtoleh. intro X. apply nopathstruetofalse. apply pathsinv0. destruct m. + assumption. + assumption. - intros m. destruct m. + apply isreflnatleh. + apply IHn. Defined.
imports: UniMath.Tactics.EnsureStructuredProofs UniMath.Foundations.PartA UniMath.Foundations.Propositions UniMath.Foundations.NaturalNumbers UniMath.Algebra.RigsAndRings UniMath.Algebra.Domains_and_Fields UniMath.NumberSystems.Integers UniMath.Algebra.Monoids