proposition: Lemma preIt_uniq (t : ∑ h, # L inF · h = ψ μF h) : t = (preIt,,preIt_ok).
proof: Proof. apply subtypePath; [intros f; apply homset_property|]; simpl. destruct t as [f Hf]; simpl. apply (colimArrowUnique CC_LchnF); intro n. now apply S_imp_SS, Hf. Qed.
imports: UniMath.Tactics.EnsureStructuredProofs UniMath.Foundations.PartD UniMath.MoreFoundations.Tactics UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Limits.Initial UniMath.CategoryTheory.Limits.Graphs.Colimits UniMath.CategoryTheory.FunctorAlgebras UniMath.CategoryTheory.Categories.HSET.Core UniMath.CategoryTheory.opp_precat UniMath.CategoryTheory.Chains.Chains UniMath.CategoryTheory.Chains.Adamek UniMath.CategoryTheory.yoneda UniMath.CategoryTheory.HorizontalComposition UniMath.CategoryTheory.whiskering