proposition: Lemma upd_Znth_diff_strong : forall {A}{d: Inhabitant A} i j l (u : A), 0 <= j < Zlength l -> i <> j -> Znth i (upd_Znth j l u) = Znth i l.
proof: Proof. intros. destruct (zlt i 0). { rewrite !Znth_underflow; auto. } destruct (zlt i (Zlength l)). apply upd_Znth_diff; auto; lia. { rewrite !Znth_overflow; auto. rewrite upd_Znth_Zlength; auto. } Qed.
imports: Coq.ZArith.ZArith Coq.Program.Basics Coq.micromega.Lia compcert.lib.Integers compcert.common.Values VST.veric.base VST.veric.Clight_lemmas VST.veric.val_lemmas VST.veric.shares VST.msl.seplog VST.msl.shares VST.zlist.sublist VST.floyd.coqlib3 VST.floyd.functional_base VST.floyd.data_at_rec_lemmas VST.zlist.list_solver CertiGraph.lib.EquivDec_ext CertiGraph.lib.List_ext CertiGraph.graph.graph_model CertiGraph.graph.graph_gen