proposition: Lemma SW_word_eq_rect_eq : forall (m n: nat) (b : bool) (a : word m) H H', SW_word b (eq_rect m word a n H) = eq_rect (S m) word (SW_word b a) (S n) H'.
proof: Proof. destruct H; simpl; intros. apply Eqdep_dec.eq_rect_eq_dec; intros; eauto using Peano_dec.eq_nat_dec. 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