proposition: Lemma gt_gs_compatible: forall (g: LGraph) (h: heap), graph_heap_compatible g h -> forall gen, graph_has_gen g gen -> generation_space_compatible g (gen, nth_gen g gen, nth_space h gen).
proof: Proof. intros. destruct H as [? [_ ?]]. rewrite gsc_iff in H by assumption. apply H. 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