proposition: Lemma graph_has_v_in_closure: forall g v, graph_has_v g v -> closure_has_v g v.
proof: Proof. intros g v. destruct v as [gen index]. unfold graph_has_v, closure_has_v, closure_has_index, gen_has_index. simpl. intros. intuition auto with *. 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