proposition: Lemma FiniteTable_FiniteTableAbsR {qsSchema} : forall (qs qs' : UnConstrQueryStructure qsSchema) (idx : Fin.t (numRawQSschemaSchemas qsSchema)), FiniteTables_AbsR qs qs' -> FiniteEnsemble (GetUnConstrRelation qs idx).
proof: Proof. unfold FiniteTables_AbsR; intros; intuition; subst; eauto. 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