proposition: Lemma ByteString_enqueue_simpl : forall b bs (paddingOK' : lt (padding bs) 7), ByteString_enqueue b bs = {| front := WS b (front bs); paddingOK := lt_n_S _ _ paddingOK'; byteString := byteString bs |}.
proof: Proof. destruct bs; simpl; intros. unfold ByteString_enqueue; simpl. destruct (eq_nat_dec padding0 7); simpl in *; try omega. repeat f_equal; eapply le_uniqueness_proof. 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