proposition: Lemma runitor_natural (a b : C) (f g : C ⟦ a, b ⟧) (x : f ==> g) : x ⋆ id2 (identity b) • runitor g = runitor f • x.
proof: Proof. rewrite hcomp_hcomp'. unfold hcomp'. rewrite <- vassocr. rewrite vcomp_runitor. rewrite vassocr. apply maponpaths_2. rewrite lwhisker_id2. apply id2_left. Qed.
imports: UniMath.Tactics.EnsureStructuredProofs UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.PrecategoryBinProduct