proposition: Lemma iscontr_functor_from_empty : iscontr (functor empty_category A).
proof: Proof. use make_iscontr. - exact functor_from_empty. - intro F. use total2_paths_f. + use total2_paths_f; apply funextsec; intro empt; induction empt. + apply proofirrelevance, isaprop_is_functor_from_empty. Defined.
imports: UniMath.Foundations.Sets UniMath.MoreFoundations.PartA UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.Core.Setcategories UniMath.CategoryTheory.Core.Univalence UniMath.CategoryTheory.FunctorCategory UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Groupoids UniMath.CategoryTheory.Limits.Initial UniMath.CategoryTheory.Limits.Terminal UniMath.CategoryTheory.Limits.BinCoproducts UniMath.CategoryTheory.Limits.BinProducts UniMath.CategoryTheory.PrecategoryBinProduct UniMath.CategoryTheory.exponentials UniMath.CategoryTheory.Adjunctions.Core UniMath.CategoryTheory.catiso UniMath.Combinatorics.StandardFiniteSets