proposition: Theorem vector_fold_false : forall (A : Set)(f : A -> A -> bool)(n : nat)(v1 v2 : Vector.t A n), Vector.fold_left2 (fun b a1 a2 => b && (f a1 a2)) false v1 v2 = false.
proof: Proof. induction n; intuition; simpl in *. rewrite (vector_0 v1). rewrite (vector_0 v2). simpl. trivial. destruct (vector_S v1). destruct (vector_S v2). destruct H. destruct H0. subst. simpl. eapply IHn. Qed.
imports: Bvector Arith