proposition: Lemma lmc_make_fields_vals_not_eq: forall (g : LGraph) (v new_v : VType) x, x <> v -> make_fields_vals (lgraph_mark_copied g v new_v) x = make_fields_vals g x.
proof: Proof. intros. unfold make_fields_vals. rewrite lmc_field2val_make_fields, lmc_vlabel_not_eq, lmc_vertex_address; [reflexivity | 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