proposition: Lemma frr_roots_graph_compatible: forall from to roots1 g1 roots2 g2, from <> to -> graph_has_gen g1 to -> copy_compatible g1 -> roots_graph_compatible roots1 g1 -> forward_roots_relation from to roots1 g1 roots2 g2 -> roots_graph_compatible roots2 g2.
proof: Proof. intros. eapply frr_rgc_aux in H3; eauto. destruct H3; 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