proposition: Lemma ByteString_enqueue_ByteString_assoc : forall l m n : ByteString, ByteString_enqueue_ByteString l (ByteString_enqueue_ByteString m n) = ByteString_enqueue_ByteString (ByteString_enqueue_ByteString l m) n.
proof: Proof. intros; rewrite (ByteString_into_queue_eq l), (ByteString_into_queue_eq m), (ByteString_into_queue_eq n), !ByteString_enqueue_ByteString_into_BitString, <- app_assoc; eauto. 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