proposition: Lemma chain_mor_coconeIn {C : category} (c : chain C) (x : C) (cc : cocone c x) i : ∏ j (Hij : i < j), chain_mor c Hij · coconeIn cc j = coconeIn cc i.
proof: Proof. induction j as [|j IHj]. - intros Hi0; destruct (negnatlthn0 _ Hi0). - intros Hij; simpl. destruct (natlehchoice4 _ _ Hij). + rewrite <- (IHj h), <- assoc. apply maponpaths, coconeInCommutes. + destruct p. apply coconeInCommutes. Qed.
imports: UniMath.Foundations.PartA UniMath.Foundations.NaturalNumbers UniMath.MoreFoundations.Tactics UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Limits.Graphs.Colimits UniMath.CategoryTheory.Limits.Graphs.Limits UniMath.CategoryTheory.Limits.Initial