proposition: Lemma Ifopt_Ifopt {A A' B} : forall (a_opt : option A) (t : A -> option A') (e : option A') (t' : A' -> B) (e' : B), Ifopt (Ifopt a_opt as a Then t a Else e) as a' Then t' a' Else e' = Ifopt a_opt as a Then (Ifopt (t a) as a' Then t' a' Else e') Else (Ifopt e as a' Then t' a' Else e').
proof: Proof. destruct a_opt; simpl; reflexivity. Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat Coq.Strings.String Coq.Arith.Mult Coq.Vectors.Vector Fiat.Common.SumType Fiat.Common.BoundedLookup Fiat.Common.ilist Fiat.Common.DecideableEnsembles Fiat.Common.List.ListFacts Fiat.Common.StringFacts Fiat.Computation Fiat.QueryStructure.Specification.Representation.Notations Fiat.QueryStructure.Specification.Representation.Heading Fiat.QueryStructure.Specification.Representation.Tuple Fiat.Narcissus.BinLib.AlignedByteString Fiat.Narcissus.BinLib.AlignWord Fiat.Narcissus.BinLib.AlignedDecoders Fiat.Narcissus.BinLib.AlignedList Fiat.Narcissus.BinLib.AlignedSumType Fiat.Narcissus.BinLib.AlignedDomainName Fiat.Narcissus.Common.Specs Fiat.Narcissus.Common.ComposeOpt Fiat.Narcissus.Automation.Solver 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.DomainNameOpt Fiat.Narcissus.Examples.DNS.SimpleDNSPacket Fiat.Common.IterateBoundedIndex Fiat.Common.Tactics.HintDbExtra Fiat.Common.Tactics.TransparentAbstract Fiat.Common.Tactics.CacheStringConstant Fiat.Narcissus.Stores.DomainNameStore Fiat.Narcissus.Automation.CacheEncoders Bedrock.Word