proposition: Lemma AlignedDecode_CollapseWord : forall (ResultT : Type) (sz sz' : nat) aligned_decoder (k : word sz -> word sz' -> _ -> CacheDecode -> option (ResultT * _ * CacheDecode)), DecodeMEquivAlignedDecodeM (fun bs cd => `(w, b', cd') <- decode_word bs cd; k (split1' sz sz' w) (split2' sz sz' w) b' cd') aligned_decoder -> DecodeMEquivAlignedDecodeM (fun bs cd => `(w, b', cd') <- decode_word bs cd; `(w', b'0, cd'0) <- decode_word b' cd'; k w w' b'0 cd'0) aligned_decoder.
proof: Proof. intros; eapply DecodeMEquivAlignedDecodeM_trans; eauto; intros; simpl; try reflexivity. rewrite CollapseWord; eauto. Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat Coq.ZArith.ZArith Coq.Strings.String Coq.Arith.Mult Coq.Vectors.Vector Fiat.Common.SumType Fiat.Common.BoundedLookup Fiat.Common.ilist Fiat.Common.DecideableEnsembles Fiat.Computation Fiat.QueryStructure.Specification.Representation.Notations Fiat.QueryStructure.Specification.Representation.Heading Fiat.QueryStructure.Specification.Representation.Tuple Fiat.Narcissus.BinLib.AlignedEncodeMonad Fiat.Narcissus.BinLib.AlignedByteString Fiat.Narcissus.BinLib.AlignWord Fiat.Narcissus.BinLib.AlignedString Fiat.Narcissus.BinLib.AlignedDecodeMonad Fiat.Narcissus.Common.Specs Fiat.Narcissus.Common.ComposeOpt Fiat.Narcissus.Formats.WordOpt Fiat.Narcissus.Formats.NatOpt Fiat.Narcissus.Formats.StringOpt Fiat.Narcissus.Formats.EnumOpt Fiat.Narcissus.Formats.FixListOpt Fiat.Narcissus.Formats.SumTypeOpt Fiat.Narcissus.Formats.EnumOpt Fiat.Narcissus.Formats.DomainNameOpt Fiat.Common.IterateBoundedIndex Fiat.Common.Tactics.CacheStringConstant Fiat.Narcissus.Formats.IPChecksum Fiat.Narcissus.Common.ComposeCheckSum Bedrock.Word