proposition: Lemma vector_hd_cons_eq : forall(A : Set)(v : Vector.t A 1), v = Vector.cons _ (Vector.hd v) _ (Vector.nil A).
proof: Proof. intuition. destruct (vector_S v). destruct H. subst. destruct (vector_0 x0). simpl. trivial. Qed.
imports: FCF.StdNat List Bvector micromega.Lia FCF.EqDec FCF.Fold ZArith