proposition: Lemma fr_O_nth_gen_unchanged: forall from to p g1 g2, graph_has_gen g1 to -> forward_relation from to O p g1 g2 -> forall gen, gen <> to -> nth_gen g1 gen = nth_gen g2 gen.
proof: Proof. intros. inversion H0; subst; try reflexivity. - rewrite lcv_nth_gen; auto. - subst new_g. transitivity (nth_gen (lgraph_copy_v g1 (dst g1 e) to) gen). 2: reflexivity. rewrite lcv_nth_gen; [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