proposition: Lemma reset_nth_sh: forall g i j, nth_sh (reset_graph j g) i = nth_sh g i.
proof: Proof. intros. destruct (Nat.eq_dec i j). - subst. unfold reset_graph, nth_sh, nth_gen. simpl. rewrite reset_nth_gen_info_same, remove_ve_glabel_unchanged. reflexivity. - apply reset_nth_sh_diff. 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