proposition: Lemma isrcancelablemonob {X Y : setwithbinop} (f : binopmono X Y) (x : X) (is : isrcancelable (@op Y) (f x)) : isrcancelable (@op X) x.
proof: Proof. unfold islcancelable. apply (isincltwooutof3a (λ x0 : X, op x0 x) f (pr2 (pr1 f))). assert (h : homot (funcomp f (λ y0 : Y, op y0 (f x))) (funcomp (λ x0 : X, op x0 x) f)). { intro x0; simpl. apply (pathsinv0 ((pr2 f) x0 x)). } apply (isinclhomot _ _ h). apply (isinclcomp f (make_incl _ is)). Defined.
imports: UniMath.Foundations.Sets UniMath.MoreFoundations.Propositions