proposition: Lemma Vmap_eq_ext : forall (A B : Type) (f g : A->B), (forall a, f a = g a) -> forall n (v : vector A n), Vmap f v = Vmap g v.
proof: Proof. induction v; intros; simpl. refl. apply Vcons_eq_intro; auto. Qed.
imports: Coq(Vector Program Structures.Equalities Morphisms) CoLoR(LogicUtil NatUtil EqUtil ListUtil BoolUtil RelUtil)