proposition: Lemma presheaf_morphism_eq {T : algebraic_theory} {P P' : presheaf T} (F F' : presheaf_morphism P P') (H : ∏ n, F n = F' n) : F = F'.
proof: Proof. apply subtypePath. { intro. use isapropdirprod. + do 4 (apply impred_isaprop; intro). apply setproperty. + exact isapropunit. } apply funextsec. exact H. Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.NaturalTransformations UniMath.Combinatorics.StandardFiniteSets UniMath.AlgebraicTheories.AlgebraicTheories UniMath.AlgebraicTheories.Presheaves UniMath.AlgebraicTheories.PresheafCategoryCore UniMath.AlgebraicTheories.IndexedSetCategory