proposition: Lemma lacv_nth_sh: forall (g : LGraph) (v : VType) (to : nat) n, graph_has_gen g to -> nth_sh (lgraph_add_copied_v g v to) n = nth_sh g n.
proof: Proof. intros. unfold nth_sh, nth_gen. simpl. destruct (Nat.eq_dec n to). - subst n. rewrite cvmgil_eq by assumption. simpl. reflexivity. - rewrite cvmgil_not_eq by assumption. reflexivity. 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