proposition: Proposition exp_funext {x y z : C} {f g : z --> exp x y} (p : ∏ (a : C) (h : a --> x), BinProductOfArrows C _ (prodC a z) h f · exp_eval x y = BinProductOfArrows C _ (prodC a z) h g · exp_eval x y) : f = g.
proof: Proof. refine (exp_eta f @ _ @ !(exp_eta g)). apply maponpaths. apply p. Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.Adjunctions.Core UniMath.CategoryTheory.whiskering UniMath.CategoryTheory.FunctorCategory UniMath.CategoryTheory.PrecategoryBinProduct UniMath.CategoryTheory.Limits.BinProducts UniMath.CategoryTheory.Equivalences.Core UniMath.CategoryTheory.Limits.Preservation UniMath.CategoryTheory.catiso UniMath.CategoryTheory.CategoryEquality UniMath.CategoryTheory.Core.Univalence