proposition: Lemma frr_backward_edge_prop: forall from to (roots1 roots2: roots_t) g1 g2, from <> to -> sound_gc_graph g1 -> graph_has_gen g1 to -> no_dangling_dst g1 -> copy_compatible g1 -> roots_graph_compatible roots1 g1 -> copied_vertex_prop g1 from to -> gen_unmarked g1 to -> forward_roots_relation from to roots1 g1 roots2 g2 -> backward_edge_prop g1 roots1 from to -> backward_edge_prop g2 roots2 from to.
proof: Proof. intros. eapply frr_bep_aux with (done:=nil); try eassumption. 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