proposition: Lemma ngr_roots_graph_compatible: forall g1 g2 roots gen, roots_graph_compatible roots g1 -> new_gen_relation gen g1 g2 -> roots_graph_compatible roots g2.
proof: Proof. intros. red in H0. destruct (graph_has_gen_dec g1 gen). - subst; auto. - destruct H0 as [gen_i [? ?]]. subst g2. unfold roots_graph_compatible in *. rewrite Forall_forall in *. intros. apply ang_graph_has_v. apply H; auto. 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