proposition: Lemma grfromltunel (X : gr) {R : hrel X} (is : isbinophrel R) {x : X} (isg : R (unel X) x) : R (grinv X x) (unel X).
proof: Proof. assert (r := (pr1 is) _ _ (grinv X x) isg). rewrite (grlinvax X x) in r. rewrite (runax X _) in r. apply r. Defined.
imports: UniMath.MoreFoundations.Orders UniMath.MoreFoundations.Tactics UniMath.MoreFoundations.Subtypes UniMath.Algebra.BinaryOperations UniMath.Algebra.Monoids