proposition: Lemma graph_gen_unmarked_iff: forall g, graph_unmarked g <-> forall gen, gen_unmarked g gen.
proof: Proof. intros. unfold graph_unmarked, gen_unmarked. split; intros. - apply H. unfold graph_has_v. simpl. split; assumption. - destruct v as [gen idx]. destruct H0. simpl in *. 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