proposition: Lemma ByteString_mappend_push_eq : forall t bs, exists pf, ByteString_push t bs = mappend {| front := WS t WO; paddingOK := pf; byteString := [ ] |} bs.
proof: Proof. assert (1 < 8)%nat by omega. intros; eexists H. destruct bs; simpl. 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