proposition: Lemma foldr_cons {A B : UU} (f : A -> B -> B) (b : B) (x : A) (xs : list A) : foldr f b (cons x xs) = f x (foldr f b xs).
proof: Proof. apply idpath. Qed.
imports: UniMath.MoreFoundations.Tactics UniMath.Combinatorics.StandardFiniteSets UniMath.Combinatorics.Vectors