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