proposition: Lemma decode_word_peek_distinct : forall sz xenv xenv' b b' x, decode_word (sz := sz) b xenv = Some (x, b', xenv') -> peekD xenv' = peekD (addD xenv sz).
proof: Proof. intros. unfold decode_word in H. destruct (decode_word' sz b); simpl in *; try discriminate. injections. reflexivity. Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat Bedrock.Word Coq.ZArith.ZArith Coq.Strings.Ascii Coq.Strings.String Coq.Logic.Eqdep_dec Fiat.Computation.Core Fiat.Computation.FixComp Fiat.Computation.Notations Fiat.Computation.Refinements.General Fiat.Common.DecideableEnsembles Fiat.Narcissus.Common.Specs Fiat.Narcissus.Formats.FixStringOpt Fiat.Narcissus.Formats.NatOpt Fiat.Narcissus.Formats.WordOpt Fiat.Narcissus.Formats.AsciiOpt