proposition: Lemma fr_graph_has_gen: forall depth from to p g g', graph_has_gen g to -> forward_relation from to depth p g g' -> forall x, graph_has_gen g x <-> graph_has_gen g' x.
proof: Proof. intros. remember (fun to g1 g2 => graph_has_gen g1 to -> forall x, graph_has_gen g1 x <-> graph_has_gen g2 x) as P. pose proof (fr_general_prop_bootstrap depth from to p g g' P). subst P. apply H1; clear H1; intros; try assumption; try reflexivity. - rewrite H1 by assumption. apply H2. rewrite <- H1; assumption. - apply lcv_graph_has_gen. assumption. 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