proposition: Lemma length_ByteString_format_option {A} : forall format_Some format_None a_opt (b : ByteString) (ctx ctx' : CacheFormat) n, (forall (a : A) (b : ByteString) (ctx ctx' : CacheFormat), computes_to (format_Some a ctx) (b, ctx') -> length_ByteString b = n) -> (forall (b : ByteString) (ctx ctx' : CacheFormat), computes_to (format_None () ctx) (b, ctx') -> length_ByteString b = n) -> format_option format_Some format_None a_opt ctx ↝ (b, ctx') -> length_ByteString b = n.
proof: Proof. destruct a_opt; simpl; intros; computes_to_inv. - eapply H; eauto. - eauto. Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat Coq.ZArith.ZArith Coq.Strings.String Coq.Vectors.Vector Fiat.Common.SumType Fiat.Common.EnumType Fiat.Common.BoundedLookup Fiat.Common.ilist Fiat.Computation Fiat.QueryStructure.Specification.Representation.Notations Fiat.QueryStructure.Specification.Representation.Heading Fiat.QueryStructure.Specification.Representation.Tuple Fiat.Narcissus.BinLib.Core Fiat.Narcissus.BinLib.AlignedByteString Fiat.Narcissus.Common.Specs Fiat.Narcissus.Common.WordFacts Fiat.Narcissus.Common.ComposeCheckSum Fiat.Narcissus.Common.ComposeIf Fiat.Narcissus.Common.ComposeOpt Fiat.Narcissus.Formats.Option Fiat.Narcissus.Formats.FixListOpt Fiat.Narcissus.Stores.EmptyStore Fiat.Narcissus.Formats.Bool Fiat.Narcissus.Formats.NatOpt Fiat.Narcissus.Formats.Vector Fiat.Narcissus.Formats.EnumOpt Fiat.Narcissus.Formats.SumTypeOpt Fiat.Narcissus.Formats.InternetChecksum Fiat.Narcissus.Formats.WordOpt Fiat.Narcissus.BaseFormats Bedrock.Word