proposition: Lemma vlabel_get_edges_snd: forall v1 v2 (g1 g2: LGraph), vlabel g1 v1 = vlabel g2 v2 -> map snd (get_edges g1 v1) = map snd (get_edges g2 v2).
proof: Proof. intros. unfold get_edges. unfold make_fields. rewrite H. remember (raw_fields (vlabel g2 v2)). remember O. clear H Heql Heqn. revert n. induction l; intros; simpl; auto. now destruct a; [destruct s |]; simpl; rewrite IHl. Qed.
imports: Coq.ZArith.ZArith Coq.Program.Basics 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 CertiGraph.lib.Coqlib CertiGraph.lib.EquivDec_ext CertiGraph.lib.List_ext CertiGraph.graph.graph_model CertiGraph.graph.graph_gen CertiGraph.graph.path_lemmas CertiGraph.graph.subgraph2 CertiGraph.graph.graph_relation CertiGraph.graph.graph_isomorphism CertiGraph.graph.reachable_ind CertiGraph.CertiGC.GCGraph