proposition: Lemma lacv_make_fields_vals_new: forall g v to, graph_has_v g v -> graph_has_gen g to -> no_dangling_dst g -> copy_compatible g -> make_fields_vals (lgraph_add_copied_v g v to) (new_copied_v g to) = make_fields_vals g v.
proof: Proof. intros. unfold make_fields_vals. rewrite lacv_vlabel_new. rewrite (lacv_field2val_make_fields_new _ _ _ _ H H0 H1). destruct (raw_mark (vlabel g v)) eqn:? . 2: reflexivity. f_equal. apply lacv_vertex_address_old. 2: assumption. apply H2; 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