proposition: Lemma limArrowCommutes {C : precategory} {g : graph} {d : diagram g C} (CC : LimCone d) (c : C) (cc : cone d c) (u : vertex g) : limArrow CC c cc · limOut CC u = coneOut cc u.
proof: Proof. exact ((pr2 (pr1 (isLimCone_LimCone CC _ cc))) u). Qed.
imports: UniMath.Foundations.PartD UniMath.Foundations.Propositions UniMath.Foundations.Sets UniMath.MoreFoundations.Tactics UniMath.MoreFoundations.Propositions UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.Core.Univalence UniMath.CategoryTheory.Adjunctions.Core UniMath.CategoryTheory.FunctorCategory UniMath.CategoryTheory.Limits.Graphs.Colimits