proposition: Lemma fr_gen_unmarked: forall from to depth p g g', graph_has_gen g to -> forward_relation from to depth p g g' -> forall gen, from <> gen -> gen_unmarked g gen -> gen_unmarked g' gen.
proof: Proof. intros. remember (fun (g: LGraph) (gen: nat) (x: nat) => x <> gen) as Q. remember (fun (g1 g2: LGraph) gen => gen_unmarked g1 gen -> gen_unmarked g2 gen) as P. remember (fun (x1 x2: nat) => True) as R. pose proof (fr_general_prop depth from to p g g' _ Q P R). subst Q P R. apply H3; clear H3; intros; try assumption; try reflexivity. - apply H4, H3. assumption. - rewrite <- H7 in H4. apply lcv_gen_unmarked; 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