proposition: Lemma eq_rect_decode_word : forall n m H b, eq_rect n (fun n0 : nat => option (word n0 * ByteString)) (decode_word' n b) m H = decode_word' m b.
proof: Proof. induction n; simpl; intros; subst; simpl. - reflexivity. - 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