proposition: Lemma length_padding_ByteString_into_queue_eq' : forall l bs, length_ByteString (fold_left (fun (bs : ByteString) (b : bool) => ByteString_enqueue b bs) l bs) = length l + length_ByteString bs.
proof: Proof. intros; rewrite <- fold_left_rev_right. rewrite <- rev_length. induction (rev l); simpl; eauto. rewrite <- IHl0. rewrite length_ByteString_enqueue; 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