proposition: Lemma foldr1_cons_nil {A : UU} (f : A -> A -> A) (a : A) (x : A) : foldr1 f a (cons x nil) = x.
proof: Proof. apply idpath. Qed.
imports: UniMath.MoreFoundations.Tactics UniMath.Combinatorics.StandardFiniteSets UniMath.Combinatorics.Vectors