proposition: Lemma ByteStringToBoundedByteString_into_queue_eq' : forall bs, ByteString_into_queue (ByteStringToBoundedByteString bs) = Core.ByteString_into_queue bs.
proof: Proof. destruct bs; unfold ByteStringToBoundedByteString; simpl. unfold ByteString_into_queue, Core.ByteString_into_queue; simpl. f_equal. clear; induction byteString0; simpl; eauto. rewrite <- IHbyteString0; 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