proposition: Lemma updateList_correct2 : forall A (v: list A) f d1 i j, i <> j -> nth i (updateList v f j) d1 = nth i v d1.
proof: Proof. induction v. reflexivity. intros f d1 i [|j] H; destruct i as [|i]; try reflexivity. elim H; auto. simpl. apply IHv. auto. Qed.
imports: CoRN.stdlib_omissions.List Coq.Arith.Arith Coq.PArith.BinPos