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