proposition: Lemma refineEquiv_Join_Comp_Lists_Build_single_Tuple_list : forall (r_n : IndexedQueryStructure qs_schema BagIndexKeys) idx, refineEquiv (Join_Comp_Lists [inil2 (B := @RawTuple)] (fun _ : ilist2 (B:= @RawTuple) [] => l <- CallBagEnumerate idx r_n ; ret (snd l))) (l <- CallBagEnumerate idx r_n ; ret (Build_single_Tuple_list (snd l))) .
proof: Proof. unfold Join_Comp_Lists, Build_single_Tuple_list; simpl; intros; repeat setoid_rewrite refineEquiv_bind_bind; repeat setoid_rewrite refineEquiv_bind_unit; f_equiv. intros u. rewrite app_nil_r; reflexivity. Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat Coq.Lists.List Coq.Program.Program Fiat.QueryStructure.Specification.Representation.Tuple Fiat.QueryStructure.Specification.Representation.Heading Fiat.Common.ilist2 Fiat.Common.i2list Fiat.Common.ilist3 Fiat.Common.i3list Coq.Bool.Bool Coq.Strings.String Coq.Structures.OrderedTypeEx Coq.Arith.Arith Fiat.Common.String_as_OT Fiat.Common.Ensembles.IndexedEnsembles Fiat.Common.DecideableEnsembles Fiat.Common.List.ListFacts Fiat.QueryStructure.Specification.Operations.FlattenCompList Fiat.QueryStructure.Implementation.Operations.General.QueryRefinements Fiat.QueryStructure.Implementation.Operations.General.InsertRefinements Fiat.QueryStructure.Implementation.Operations.General.EmptyRefinements Fiat.QueryStructure.Specification.Representation.QueryStructureNotations Fiat.QueryStructure.Implementation.ListImplementation Fiat.Common.List.PermutationFacts Fiat.QueryStructure.Implementation.DataStructures.BagADT.BagADT Fiat.QueryStructure.Implementation.DataStructures.BagADT.QueryStructureImplementation Fiat.QueryStructure.Implementation.DataStructures.BagADT.IndexSearchTerms Fiat.QueryStructure.Implementation.Operations.General.DeleteRefinements