proposition: Lemma upd_Znth_graph_compatible: forall g roots z, roots_graph_compatible roots g -> forall v : VType, graph_has_v g v -> roots_graph_compatible (upd_Znth z roots (inr v)) g.
proof: Proof. intros. red in H |-* . rewrite Forall_forall in H |-* . intros. rewrite <- filter_sum_right_In_iff in H1. apply In_upd_Znth in H1. destruct H1. inversion H1; assumption. apply H. rewrite <- filter_sum_right_In_iff. assumption. 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