proposition: Lemma ang_vertex_address_old: forall (g : LGraph) (gi : generation_info) (v : VType), graph_has_v g v -> vertex_address (lgraph_add_new_gen g gi) v = vertex_address g v.
proof: Proof. intros. unfold vertex_address. f_equal. unfold gen_start. destruct H. rewrite if_true by (rewrite ang_graph_has_gen; left; assumption). rewrite if_true by assumption. rewrite ang_nth_old by assumption. 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