proposition: Lemma lacv_vertex_address: forall (g : LGraph) (v : VType) (to: nat) x, closure_has_v g x -> graph_has_gen g to -> vertex_address (lgraph_add_copied_v g v to) x = vertex_address g x.
proof: Proof. intros. destruct x as [n m]. destruct H. simpl in *. unfold vertex_address. f_equal. - f_equal. unfold vertex_offset. f_equal. unfold previous_vertices_size. simpl. apply fold_left_ext. intros. unfold vertex_size_accum. f_equal. unfold vertex_size. f_equal. rewrite lacv_vlabel_old. 1: reflexivity. intro. unfold new_copied_v in H3. inversion H3. rewrite nat_inc_list_In_iff in H2. subst n. red in H1. lia. - simpl. apply lacv_gen_start. assumption. 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