proposition: Lemma BoundedByteStringToByteString_into_queue_eq : forall l, Core.queue_into_ByteString l = BoundedByteStringToByteString (queue_into_ByteString l).
proof: Proof. unfold queue_into_ByteString, Core.queue_into_ByteString. intros. replace Core.ByteString_id with (BoundedByteStringToByteString ByteString_id) by apply BoundedByteStringToByteString_ByteString_id_eq. generalize ByteString_id. induction l; intros. - reflexivity. - rewrite <- !fold_left_cons; simpl. rewrite <- IHl. rewrite ByteString_enqueue_ByteStringToBoundedByteString_eq'; 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