proposition: Lemma ith_Bounded_BuildEmptyRelations {n} : forall ns idx, ith2 (Build_EmptyRelations (n := n) ns) idx = EmptyRelation _.
proof: Proof. induction ns; intros. - inversion idx; subst. - revert ns IHns. pattern n, idx. apply Fin.caseS; simpl; intros; eauto. Qed.
imports: Coq.Strings.String Coq.ZArith.ZArith Coq.Lists.List Coq.Logic.FunctionalExtensionality Coq.Sets.Ensembles Fiat.Common.SetEq Fiat.Common.ilist2 Fiat.Common.Ensembles.IndexedEnsembles Fiat.Computation Fiat.ADT Fiat.Common.Ensembles.EnsembleListEquivalence Fiat.ADTRefinement Fiat.ADTNotation Fiat.QueryStructure.Specification.Representation.QueryStructureSchema Fiat.ADTRefinement.BuildADTRefinements Fiat.QueryStructure.Specification.Operations.Empty Fiat.QueryStructure.Specification.Representation.QueryStructure