proposition: Lemma generation_rep_reset_diff: forall (g: LGraph) i j, i <> j -> generation_rep (reset_graph j g) i = generation_rep g i.
proof: Proof. intros. unfold generation_rep. rewrite <- !iter_sepcon_map. rewrite reset_nth_gen_diff, reset_nth_sh_diff by assumption. apply iter_sepcon_func; intros. apply vertex_rep_reset. 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