proposition: Lemma AlignedDecodeMEquiv_trans {A : Type} {n}: forall (a1 a2 a3 : AlignedDecodeM A n), AlignedDecodeMEquiv a1 a2 -> AlignedDecodeMEquiv a2 a3 -> AlignedDecodeMEquiv a1 a3.
proof: Proof. unfold AlignedDecodeMEquiv; intros; congruence. 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