proposition: Lemma weqinvweq (F : A → (forgetful_functor T : hSet)) : theory_morphism_to_function (function_to_theory_morphism F) = F.
proof: Proof. apply funextfun. intro. refine (lift_constant_eq _ _ _ _ (idpath _) @ _). exact (comp_pr _ _). Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Adjunctions.Core UniMath.CategoryTheory.Categories.HSET.Core UniMath.CategoryTheory.Categories.HSET.Limits UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.coslicecat UniMath.CategoryTheory.DisplayedCats.Total UniMath.CategoryTheory.Equivalences.Core UniMath.CategoryTheory.Limits.Graphs.Limits UniMath.Combinatorics.StandardFiniteSets UniMath.Combinatorics.Vectors UniMath.AlgebraicTheories.AlgebraCategory UniMath.AlgebraicTheories.AlgebraCategoryCore UniMath.AlgebraicTheories.AlgebraicTheories UniMath.AlgebraicTheories.AlgebraicTheoryCategoryCore UniMath.AlgebraicTheories.AlgebraicTheoryMorphisms UniMath.AlgebraicTheories.AlgebraMorphisms UniMath.AlgebraicTheories.Algebras