fact: Definition DecomposeRawQueryStructureSchema_AbsR' {m : nat} {qs_schema : QueryStructureSchema} (schemaIdx' : BoundedIndex (QSschemaNames qs_schema)) (schemaIdx := ibound (indexb schemaIdx')) {attrIdx' : BoundedIndex (HeadingNames (QSGetNRelSchemaHeading (qs_schema) schemaIdx'))} (attrIdx := ibound (indexb attrIdx')) (attrIdx_inj : Fin.t _ -> Fin.t _) (a_proj : Vector.nth _ (attrIdx_inj attrIdx) -> Fin.t m) (el : _ -> Vector.nth (AttrList (GetNRelSchemaHeading (qschemaSchemas qs_schema) schemaIdx)) _) (r_o : UnConstrQueryStructure qs_schema) (r_n : UnConstrQueryStructure qs_schema * UnConstrQueryStructure (DecomposeRawQueryStructureSchema m qs_schema schemaIdx (attrIdx_inj attrIdx))) : Prop := DecomposeRawQueryStructureSchema_AbsR (qs_schema := qs_schema) schemaIdx (attrIdx_inj attrIdx) a_proj el r_o r_n.
imports: Fiat.Common.Coq__8_4__8_5__Compat Coq.Vectors.Vector Coq.Strings.Ascii Coq.Bool.Bool Coq.Lists.List Fiat.Common.SumType Fiat.Computation.ListComputations Fiat.QueryStructure.Automation.AutoDB Bedrock.Word Bedrock.Memory