proposition: Lemma ByteString_enqueue_into_BitString : forall b (l : BitString), ByteString_enqueue b (queue_into_ByteString l) = queue_into_ByteString (l ++ [b]).
proof: Proof. unfold queue_into_ByteString; intros. remember ByteString_id. clear Heqb0; revert b0; induction l; simpl. - intros; reflexivity. - simpl; intros. eapply IHl. 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