proposition: Lemma do_gen_iso: forall from to roots1 roots2 g1 g2, from <> to -> sound_gc_graph g1 -> graph_has_gen g1 to -> graph_unmarked g1 -> roots_graph_compatible roots1 g1 -> no_dangling_dst g1 -> no_edge2gen g1 from -> do_generation_relation from to roots1 roots2 g1 g2 -> gc_graph_iso g1 roots1 g2 roots2.
proof: Proof. pose (H3:=True). intros. destruct H7 as [g3 [g4 [? [? ?]]]]. subst g2. apply (quasi_iso_reset_iso _ _ _ _ _ to); auto. - eapply frr_dsr_quasi_iso; eauto. - eapply (dsr_sound g3 g4); eauto. + eapply frr_sound; eauto. + rewrite <- frr_graph_has_gen; eauto. - eapply frr_dsr_no_edge2gen; eauto. + rewrite graph_gen_unmarked_iff in H2. apply H2. + apply graph_unmarked_copy_compatible; 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