proposition: Lemma refine_SatisfiesAttributeConstraints_self : forall (qsSchema : RawQueryStructureSchema) (Ridx : Fin.t _) (tup : @RawTuple (rawSchemaHeading (GetNRelSchema (qschemaSchemas qsSchema) Ridx))), refine {b | decides b (SatisfiesAttributeConstraints Ridx tup )} match (attrConstraints (GetNRelSchema (qschemaSchemas qsSchema) _)) with Some Constr => {b | decides b (Constr tup) } | None => ret true end.
proof: Proof. unfold SatisfiesAttributeConstraints. intros; match goal with |- context [attrConstraints ?A] => destruct (attrConstraints A) end; eauto using decides_True. reflexivity. Qed.
imports: Fiat.QueryStructure.Specification.Representation.QueryStructureNotations Fiat.QueryStructure.Specification.Operations.Query Coq.Lists.List Coq.Arith.Compare_dec Coq.Bool.Bool Coq.Strings.String Fiat.Common.BoolFacts Fiat.Common.List.PermutationFacts Fiat.Common.List.ListMorphisms Fiat.QueryStructure.Specification.Operations.FlattenCompList Fiat.Common.Ensembles.EnsembleListEquivalence Fiat.QueryStructure.Implementation.Operations.General.QueryRefinements Fiat.Common.IterateBoundedIndex Fiat.Common.List.ListFacts Fiat.Common.LogicFacts Fiat.Common.DecideableEnsembles Fiat.Computation.Refinements.Iterate_Decide_Comp Fiat.Computation.Refinements.General Fiat.QueryStructure.Specification.Constraints.tupleAgree Fiat.QueryStructure.Specification.Operations.Mutate