proposition: Lemma hzgthsntogeh ( n m : hz ) ( p : hzgth ( n + 1 ) m ) : hzgeh n m.
proof: Proof. intros. set ( c := hzgthchoice2 ( n + 1 ) m ). destruct c as [ h | k ]. - exact p. - assert ( hzgth n m ) as a by exact ( hzgthandplusrinv n m 1 h ). apply hzgthtogeh. exact a. - rewrite ( hzplusrcan n m 1 k ). apply isreflhzgeh. 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