proposition: Lemma iscontr_empty_tuple (A : UU) : iscontr (stn 0 → A).
proof: Proof. exists (weqvecfun 0 vnil). abstract ( intro v; apply funextfun; intro i; apply fromstn0; exact i ). Defined.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.Combinatorics.StandardFiniteSets UniMath.Combinatorics.Vectors