proposition: Lemma Graph_vgen_vgamma: forall (G: Graph) (x: addr) (d d': DV) l r, vgamma G x = (d, l, r) -> vgamma (Graph_vgen G x d') x = (d', l, r).
proof: Proof. intros. simpl in H |- *. inversion H; subst. f_equal. f_equal. unfold update_vlabel. destruct_eq_dec x x; [| congruence]. auto. Qed.
imports: CertiGraph.lib.Ensembles_ext Coq.Lists.List VST.msl.seplog VST.msl.log_normalize CertiGraph.lib.Coqlib CertiGraph.lib.EquivDec_ext CertiGraph.msl_ext.log_normalize CertiGraph.msl_ext.iter_sepcon CertiGraph.msl_ext.seplog CertiGraph.graph.graph_model CertiGraph.graph.path_lemmas CertiGraph.graph.reachable_computable CertiGraph.graph.reachable_ind CertiGraph.graph.subgraph2 CertiGraph.graph.graph_gen CertiGraph.graph.BinGraph CertiGraph.graph.MathGraph CertiGraph.graph.FiniteGraph CertiGraph.msl_application.Graph Coq.Logic.Classical