proposition: Lemma lmc_vertex_rep_not_eq: forall sh g v new_v x, x <> v -> vertex_rep sh (lgraph_mark_copied g v new_v) x = vertex_rep sh g x.
proof: Proof. intros. unfold vertex_rep. rewrite lmc_vertex_address, lmc_make_fields_vals_not_eq. 2: assumption. f_equal. unfold make_header. rewrite lmc_vlabel_not_eq by assumption. reflexivity. Qed.
imports: VST.veric.compcert_rmaps VST.msl.shares VST.msl.wand_frame VST.concurrency.conclib CertiGraph.lib.List_ext CertiGraph.msl_ext.log_normalize CertiGraph.msl_ext.ramification_lemmas CertiGraph.graph.graph_model CertiGraph.CertiGC.GCGraph CertiGraph.CertiGC.env_graph_gc CertiGraph.msl_ext.iter_sepcon Coq.Lists.List