proposition: Lemma Vnth_addr : forall k n (v : vector A n) a (H1 : k < S n) (H2 : k = n), Vnth (Vadd v a) H1 = a.
proof: Proof. intros. subst k. assert (H2 : H1 = Nat.lt_succ_diag_r n). apply lt_unique. subst H1. generalize dependent v. intro v. elim v. simpl. refl. intros a' p' v' Hrec. simpl. rewrite <- Hrec at -1. apply Vnth_eq. refl. Qed.
imports: Coq(Vector Program Structures.Equalities Morphisms) CoLoR(LogicUtil NatUtil EqUtil ListUtil BoolUtil RelUtil)