proposition: Lemma get_edges_In: forall g v s, In (v, s) (get_edges g v) <-> In s (map snd (get_edges g v)).
proof: Proof. intros. unfold get_edges, make_fields. remember (raw_fields (vlabel g v)). remember 0 as n. clear Heqn Heql. revert n. induction l; intros; simpl. 1: reflexivity. destruct a; [destruct s0 |]; simpl; rewrite IHl; try reflexivity. intuition auto. inversion H0. left; reflexivity. 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