proposition: Lemma vertex_rep_add: forall (g : LGraph) (gi : generation_info) v sh, graph_has_v g v -> copy_compatible g -> no_dangling_dst g -> vertex_rep sh g v = vertex_rep sh (lgraph_add_new_gen g gi) v.
proof: Proof. intros. unfold vertex_rep. rewrite ang_vertex_address_old; auto. rewrite <- ang_make_header, <- ang_make_fields_vals_old; auto. 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