proposition: Lemma DropQSConstraintsQuery_In_UnderBinder {A B} : forall qs_schema qs R bod, (fun b : B => @Query_In A qs_schema qs R (bod b)) = (fun b : B => UnConstrQuery_In (DropQSConstraints qs) R (bod b)).
proof: Proof. intros; unfold Query_In, UnConstrQuery_In, GetRelation, GetUnConstrRelation, DropQSConstraints; rewrite <- ith_imap2. reflexivity. Qed.
imports: Coq.Arith.Arith Coq.ZArith.ZArith Coq.NArith.NArith Coq.ZArith.ZArith Coq.Strings.String Coq.Lists.List Coq.Sorting.Permutation Coq.Bool.Bool Coq.Sets.Ensembles Coq.Logic.FunctionalExtensionality Fiat.ADTNotation Fiat.Common Fiat.Common.ilist2 Fiat.Common.List.ListFacts Fiat.Common.Ensembles.IndexedEnsembles Fiat.Common.DecideableEnsembles Fiat.Computation Fiat.ADTRefinement.BuildADTRefinements Fiat.QueryStructure.Specification.Representation.QueryStructureSchema Fiat.QueryStructure.Specification.Operations.FlattenCompList Fiat.QueryStructure.Specification.Operations.Query Fiat.QueryStructure.Specification.Representation.QueryStructure