proposition: Lemma fold_left_upd_Znth_diff: forall (A : Type) (X : Inhabitant A) (f : A -> A) (ps : list Z) (l : list A) (i : Z), ~ In i ps -> 0 <= i < Zlength l -> Znth i (fold_left (fun (il : list A) (i0 : Z) => upd_Znth i0 il (f (Znth i0 il))) ps l) = Znth i l.
proof: Proof. do 3 intro. induction ps; intros; simpl; auto. assert (a<>i /\ ~In i ps) by (apply Decidable.not_or; assumption). clear H; destruct H1. rewrite IHps; auto. list_solve. list_solve. Qed.
imports: Coq.ZArith.ZArith Coq.Program.Basics 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 CertiGraph.lib.Coqlib CertiGraph.lib.EquivDec_ext CertiGraph.lib.List_ext CertiGraph.graph.graph_model CertiGraph.graph.graph_gen CertiGraph.graph.path_lemmas CertiGraph.graph.subgraph2 CertiGraph.graph.graph_relation CertiGraph.graph.graph_isomorphism CertiGraph.graph.reachable_ind CertiGraph.CertiGC.GCGraph