proposition: Lemma extend_tuple_inl {T : UU} {n : nat} (f : stn n → T) (last : T) (i : stn n) : extend_tuple f last (stnweq (inl i)) = f i.
proof: Proof. exact (maponpaths _ (homotinvweqweq _ (inl i))). Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.Combinatorics.StandardFiniteSets UniMath.Combinatorics.Vectors