proposition: Lemma lmc_make_fields_vals_eq: forall (g : LGraph) (v new_v : VType), make_fields_vals (lgraph_mark_copied g v new_v) v = vertex_address g new_v :: tl (make_fields_vals g v).
proof: Proof. intros. unfold make_fields_vals at 1. simpl. unfold update_copied_old_vlabel, graph_gen.update_vlabel. rewrite if_true by reflexivity. simpl. rewrite lmc_vertex_address. assert (tl (make_fields_vals g v) = tl (map (field2val (raw_tag (vlabel g v)) g) (make_fields g v))) by (unfold make_fields_vals; destruct (raw_mark (vlabel g v)); simpl; reflexivity). rewrite H. clear H. do 2 f_equal. apply lmc_field2val_make_fields. 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