proposition: Lemma EqualizerEndo_is_identity {a b : C} {f g : C⟦a, b⟧} (E : Equalizer f g) (k : C⟦lim E, lim E⟧) (kH : k · EqualizerArrow E = EqualizerArrow E) : identity (lim E) = k.
proof: Proof. apply lim_endo_is_identity. unfold limOut. use two_rec_dep; cbn. + apply kH. + set (X := (coneOutCommutes (limCone E) One Two (ii1 tt))). use (pathscomp0 (! (maponpaths (λ h' : _, k · h') X))). use (pathscomp0 _ X). rewrite assoc; change (dmor _ _) with f. apply cancel_postcomposition, kH. Qed.
imports: UniMath.Foundations.PartD UniMath.Foundations.Propositions UniMath.Foundations.Sets UniMath.MoreFoundations.Tactics UniMath.Combinatorics.StandardFiniteSets UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Limits.Graphs.Limits UniMath.CategoryTheory.Limits.Graphs.Colimits UniMath.CategoryTheory.Limits.Equalizers