proposition: Lemma GetRelDropConstraints {qsSchema : QueryStructureSchema} (qs : QueryStructure qsSchema) (Ridx : _) : GetUnConstrRelation (DropQSConstraints qs) Ridx = GetRelation qs Ridx.
proof: Proof. unfold GetUnConstrRelation, DropQSConstraints, GetRelation. rewrite <- ith_imap2; reflexivity. Qed.
imports: Coq.Lists.List Coq.Strings.String Coq.Logic.FunctionalExtensionality Coq.Sets.Ensembles Coq.Arith.Arith Fiat.Computation.Core Fiat.ADT.ADTSig Fiat.ADT.Core Fiat.Common.StringBound Fiat.Common.ilist2 Fiat.Common.ilist Fiat.ADTNotation.BuildADT Fiat.ADTNotation.BuildADTSig Fiat.Common.Ensembles.IndexedEnsembles Fiat.QueryStructure.Specification.Representation.Notations Fiat.QueryStructure.Specification.Representation.Heading Fiat.QueryStructure.Specification.Representation.Tuple Fiat.QueryStructure.Specification.Representation.Schema Fiat.QueryStructure.Specification.Representation.Relation Fiat.QueryStructure.Specification.Representation.QueryStructureSchema