proposition: Lemma abgrdiffrelimpl (X : abmonoid) {L L' : hrel X} (is : isbinophrel L) (is' : isbinophrel L') (impl : ∏ x x', L x x' -> L' x x') (x x' : abgrdiff X) (ql : abgrdiffrel X is x x') : abgrdiffrel X is' x x'.
proof: Proof. generalize ql. refine (quotrelimpl _ _ _ _ _). intros x0 x0'. simpl. apply hinhfun. intro t2. split with (pr1 t2). apply (impl _ _ (pr2 t2)). Defined.
imports: UniMath.MoreFoundations.Orders UniMath.MoreFoundations.Tactics UniMath.MoreFoundations.Subtypes UniMath.Algebra.BinaryOperations UniMath.Algebra.Monoids