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