proposition: Lemma padding_ByteString_enqueue_ByteString : forall bs bs', padding (ByteString_enqueue_ByteString bs bs') = (padding bs + padding bs')%nat mod 8.
proof: Proof. intros. rewrite (ByteString_into_queue_eq bs), (ByteString_into_queue_eq bs'). rewrite ByteString_enqueue_ByteString_into_BitString. rewrite !padding_ByteString_queue_into_ByteString. rewrite app_length. rewrite Nat.add_mod by omega. 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