proposition: Lemma dgc_imply_fc: forall g t_info from to, do_generation_condition g t_info from to -> forward_condition g t_info from to /\ 0 < gen_size t_info to /\ gen_unmarked g to.
proof: Proof. intros. destruct H. do 2 (split; [|intuition auto]). clear H0. red in H |-* . transitivity (graph_gen_size g from); [apply unmarked_gen_size_le | 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