proposition: Lemma ReturnAlignedDecodeM_LeftUnit {A B : Type} {n}: forall (a : A) (f : A -> AlignedDecodeM B n), AlignedDecodeMEquiv (BindAlignedDecodeM (ReturnAlignedDecodeM a) f) (f a).
proof: Proof. unfold ReturnAlignedDecodeM, BindAlignedDecodeM, AlignedDecodeMEquiv; simpl; intros. 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 Fiat.Narcissus.BinLib.Core Fiat.Narcissus.BinLib.AlignedByteString