proposition: Lemma EncodeMEquivAlignedEncodeM_morphism {S : Type} {cache : Cache} : forall x (encode encode': forall sz : nat, AlignedEncodeM sz), (forall sz v idx w c, encode' sz v idx w c = encode sz v idx w c) -> EncodeMEquivAlignedEncodeM (S := S) x encode -> EncodeMEquivAlignedEncodeM (S := S) x encode'.
proof: Proof. unfold EncodeMEquivAlignedEncodeM; intros * Heq Hequiv. setoid_rewrite <- Heq in Hequiv. assumption. 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.Common.BoundedLookup Fiat.Narcissus.Common.Specs Fiat.Narcissus.Common.ComposeOpt Fiat.Narcissus.Common.ComposeIf Fiat.Narcissus.BaseFormats Fiat.Narcissus.BinLib.Core Fiat.Narcissus.BinLib.AlignedByteString