proposition: Lemma frr_copy_compatible: forall from to roots g roots' g', from <> to -> graph_has_gen g to -> forward_roots_relation from to roots g roots' g' -> copy_compatible g -> copy_compatible g'.
proof: Proof. intros. induction H1. 1: assumption. apply IHforward_roots_relation. - rewrite <- fr_graph_has_gen; eauto. - eapply fr_copy_compatible; eauto. 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