proposition: Lemma fr_roots_outlier_compatible: forall from to p g roots outlier, roots_outlier_compatible roots outlier -> roots_outlier_compatible (upd_roots from to p g roots) outlier.
proof: Proof. intros. destruct p; simpl in *. 2: assumption. assert (roots_outlier_compatible (upd_Znth z roots (Znth z roots)) outlier) by (rewrite upd_Znth_unchanged'; auto). unfold upd_root. destruct (Znth z roots) eqn: ?; auto. if_tac; auto. destruct (raw_mark (vlabel g v)); apply upd_roots_outlier_compatible; 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