proposition: Lemma Vector_nth_tl {A} : forall n (v : Vector.t A (S n)) p, Vector.nth v (Fin.FS p) = Vector.nth (Vector.tl v) p.
proof: Proof. intros ? ?; pattern n, v; apply Vector.rectS; simpl; intros. inversion p. reflexivity. Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat Bedrock.Word Coq.ZArith.ZArith Coq.NArith.NArith Coq.Arith.Arith Coq.Numbers.Natural.Peano.NPeano Coq.Logic.Eqdep_dec Fiat.Narcissus.Common.Specs Fiat.Narcissus.BinLib.Core Fiat.Narcissus.Formats.ByteBuffer Coq.Strings.String Coq.Vectors.Vector Fiat.Narcissus.Formats.WordOpt Fiat.Common.Equality