proposition: Lemma isasetFinSig : isaset (∑ n, unit ⨿ (stn n ⨿ unit)).
proof: Proof. apply isaset_total2. - apply isasetnat. - intros. repeat apply isasetcoprod; try apply isasetunit. apply isasetstn. Qed.
imports: UniMath.Foundations.PartD UniMath.Foundations.Sets UniMath.Combinatorics.StandardFiniteSets UniMath.Combinatorics.Lists UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.FunctorCategory UniMath.CategoryTheory.Categories.HSET.Core UniMath.CategoryTheory.Categories.HSET.Colimits UniMath.CategoryTheory.Limits.Initial UniMath.CategoryTheory.Limits.BinProducts UniMath.CategoryTheory.Limits.BinCoproducts UniMath.CategoryTheory.FunctorAlgebras UniMath.CategoryTheory.Monads.Monads UniMath.SubstitutionSystems.Signatures UniMath.SubstitutionSystems.Notation UniMath.SubstitutionSystems.BindingSigToMonad UniMath.SubstitutionSystems.LiftingInitial_alt