proposition: Lemma EquivSearchTerm_True {heading : RawHeading} (SearchTermT' : SearchUpdateTerms heading) Patterns {eqv_st' : EquivSearchTerm SearchTermT' (fun _ => True) Patterns} : forall tup Pattern, List.In Pattern Patterns -> BagMatchSearchTerm SearchTermT' Pattern tup = true.
proof: Proof. intros. pose proof (OK_search_pattern eqv_st' tup Pattern H). destruct (BagMatchSearchTerm SearchTermT' _ tup); eauto. Qed.
imports: Coq.Lists.List Coq.Program.Program Coq.Bool.Bool Coq.Strings.String Coq.Structures.OrderedTypeEx Coq.Arith.Arith Fiat.Common.ilist3 Fiat.Common.i3list Fiat.Common.Ensembles.IndexedEnsembles Fiat.Computation Fiat.ADT Fiat.ADTRefinement Fiat.ADTNotation Fiat.QueryStructure.Specification.Representation.Notations Fiat.QueryStructure.Specification.Representation.QueryStructureSchema Fiat.QueryStructure.Specification.Representation.QueryStructure Fiat.QueryStructure.Specification.Representation.QueryStructureNotations Fiat.QueryStructure.Implementation.DataStructures.BagADT.BagADT Fiat.Common.ilist3_pair Fiat.Common.ilist3 Fiat.Common.i3list2 Fiat.QueryStructure.Implementation.DataStructures.Bags.BagsOfTuples Fiat.QueryStructure.Implementation.DataStructures.BagADT.BagImplementation