proposition: Lemma uOF_comp {C:category} {X Y Z:[C^op,HSET]} (r:Representation X) (s:Representation Y) (t:Representation Z) (p:X-->Y) (q:Y-->Z) : t \\ ((q ∘ p) ⟳ r) = (t \\ (q ⟳ s)) ∘ (s \\ (p ⟳ r)).
proof: Proof. unshelve refine (transportf (λ k, _ \\ k = _) (nattrans_nattrans_arrow_assoc _ _ _) _). unshelve refine (_ @ !univ_arrow_mor_assoc _ _ _). apply maponpaths. unshelve refine (_ @ nattrans_arrow_mor_assoc _ _ _). apply (maponpaths (λ k, q ⟳ k)). apply pathsinv0. apply universalMapProperty. Qed.
imports: UniMath.Foundations.Preamble UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.Univalence UniMath.CategoryTheory.opp_precat UniMath.CategoryTheory.yoneda UniMath.CategoryTheory.Categories.HSET.Core UniMath.CategoryTheory.Categories.HSET.MonoEpiIso UniMath.CategoryTheory.RepresentableFunctors.Bifunctor UniMath.CategoryTheory.RepresentableFunctors.Precategories UniMath.MoreFoundations.Tactics