proposition: Lemma VectorIn_cons {A} {n} : forall (v : Vector.t A n) a a', Vector.In a' (Vector.cons _ a _ v) -> a = a' \/ Vector.In a' v.
proof: Proof. intros; inversion H; subst; eauto. apply Eqdep_dec.inj_pair2_eq_dec in H3; subst; eauto using Peano_dec.eq_nat_dec. Qed.
imports: Fiat.Common.BoundedLookup Fiat.Narcissus.Common.Specs Fiat.Narcissus.BaseFormats Fiat.Narcissus.Formats.WordOpt Coq.Vectors.Vector Bedrock.Word