proposition: Lemma ByteStringToBoundedByteString_enqueue_word : forall n (front : word n) bs, ByteStringToBoundedByteString (Core.ByteString_enqueue_word front bs) = ByteString_enqueue_word front (ByteStringToBoundedByteString bs).
proof: Proof. Local Transparent Core.ByteString_enqueue_word. induction front0; simpl. - reflexivity. - intros. rewrite <- ByteString_enqueue_ByteStringToBoundedByteString_eq. rewrite IHfront0; reflexivity. Opaque Core.ByteString_enqueue_word. 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