proposition: Lemma AlignedDecodeBindUnusedCharM {C : Type} (t : unit -> DecodeM (C * ByteString) ByteString) (t' : unit -> forall {numBytes}, AlignedDecodeM C numBytes) : (DecodeMEquivAlignedDecodeM (t ()) (@t' ())) -> DecodeMEquivAlignedDecodeM (fun v cd => `(a, b0, cd') <- decode_unused_word (sz := 8) (monoidUnit := ByteString_QueueMonoidOpt) v cd; t a b0 cd') (fun numBytes => b <- SkipCurrentByte; @t' b numBytes)%AlignedDecodeM.
proof: Proof. intro; eapply Bind_DecodeMEquivAlignedDecodeM; eauto using AlignedDecodeUnusedCharM. intro; destruct a; eauto. Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat Coq.Logic.Eqdep_dec Fiat.Computation Fiat.Narcissus.Common.Specs Fiat.Narcissus.Common.ComposeOpt Fiat.Narcissus.Formats.WordOpt Fiat.Narcissus.Formats.EnumOpt Fiat.Narcissus.Formats.Sequence Fiat.Narcissus.BaseFormats Fiat.Narcissus.BinLib.AlignedEncodeMonad Coq.Vectors.Vector Coq.ZArith.ZArith Bedrock.Word Fiat.Narcissus.BinLib.AlignedByteString Fiat.Narcissus.BinLib.AlignedDecodeMonad