proposition: Lemma lmc_vertex_address: forall g v new_v x, vertex_address (lgraph_mark_copied g v new_v) x = vertex_address g x.
proof: Proof. intros. unfold vertex_address. f_equal. f_equal. unfold vertex_offset. f_equal. unfold previous_vertices_size. apply fold_left_ext. intros. unfold vertex_size_accum. f_equal. unfold vertex_size. f_equal. simpl. unfold update_copied_old_vlabel, graph_gen.update_vlabel. destruct (EquivDec.equiv_dec v (vgeneration x, y)). - unfold Equivalence.equiv in e. rewrite <- e. simpl. reflexivity. - 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