proposition: Lemma queue_into_ByteString_app : forall l' l, queue_into_ByteString (l ++ l') = fold_left (fun bs b => ByteString_enqueue b bs) l' (queue_into_ByteString l).
proof: Proof. induction l'; simpl; intros. - rewrite app_nil_r; eauto. - rewrite ByteString_enqueue_into_BitString. rewrite <- IHl', <- app_assoc; 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