proposition: Lemma whisker_right_on_comp {C : prebicategory} {a b c : C} {f g h : a -1-> b} (alpha : f -2-> g) (alpha' : g -2-> h) (i : b -1-> c) : whisker_right (alpha ;v; alpha') i = whisker_right alpha i ;v; whisker_right alpha' i.
proof: Proof. unfold whisker_right. intermediate_path ((alpha;v;alpha');h;(identity i;v; identity i)). rewrite id_left. reflexivity. now apply interchange. Defined.
imports: UniMath.Foundations.PartD UniMath.MoreFoundations.Tactics UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.Core.Univalence UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.PrecategoryBinProduct UniMath.CategoryTheory.Categories.StandardCategories UniMath.CategoryTheory.HorizontalComposition UniMath.CategoryTheory.Equivalences.Core UniMath.Bicategories.WkCatEnrichment.prebicategory UniMath.Bicategories.WkCatEnrichment.Notations