proposition: Lemma Znth_tl {A} {d: Inhabitant A}: forall (l: list A) i, 0 <= i -> Znth i (tl l) = Znth (i + 1) l.
proof: Proof. intros. destruct l; simpl. - unfold Znth; if_tac; if_tac; try lia; destruct (Z.to_nat (i + 1)); destruct (Z.to_nat i); simpl; reflexivity. - rewrite Znth_pos_cons by lia. replace (i + 1 - 1) with i by lia. 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