proposition: Lemma nattohzandlthinv ( n m : nat ) ( p : hzlth ( nattohz n ) (nattohz m ) ) : natlth n m.
proof: Proof. intros. rewrite <- ( hzabsvalandnattohz n ). rewrite <- ( hzabsvalandnattohz m ). apply hzabsvalandlth. - change 0 with ( nattohz 0%nat ). apply nattohzandleh. apply natleh0n . - assumption. 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