proposition: Lemma runitor_is_runitor_rwhisker (a : C) : runitor (identity a · identity a) = runitor (identity a) ▹ (identity a).
proof: Proof. apply (vcomp_rcancel (runitor _ )). - apply is_invertible_2cell_runitor. - apply pathsinv0. apply vcomp_runitor . Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.Bicategories.Core.Bicat UniMath.Bicategories.Core.Invertible_2cells UniMath.Bicategories.Core.Examples.OpMorBicat UniMath.Bicategories.Core.Examples.OpCellBicat