proposition: Lemma length_ByteString_enqueue_ByteString : forall bs1 bs2, length_ByteString (ByteString_enqueue_ByteString bs1 bs2) = length_ByteString bs1 + length_ByteString bs2.
proof: Proof. intros; rewrite (ByteString_into_queue_eq bs1), (ByteString_into_queue_eq bs2). rewrite ByteString_enqueue_ByteString_into_BitString. rewrite !length_ByteString_queue_into_ByteString, app_length; 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 Coq.Strings.String Coq.Vectors.Vector Fiat.Narcissus.Formats.WordOpt Fiat.Common.Equality