proposition: Lemma Vnth_remove_last_intro : forall n (v : vector A (S n)) i (h1 : i<n) (h2 : i<S n), Vnth v h2 = Vnth (Vremove_last v) h1.
proof: Proof. intros n v i h1 h2. unfold Vremove_last. rewrite Vnth_sub. apply Vnth_eq. refl. Qed.
imports: Coq(Vector Program Structures.Equalities Morphisms) CoLoR(LogicUtil NatUtil EqUtil ListUtil BoolUtil RelUtil)