fact: Definition DecomposeRawQueryStructureSchema_Insert_AbsR_eq {m : nat} {qs_schema : QueryStructureSchema} : forall (schemaIdx : Fin.t _) (attrIdx : Fin.t _) a_proj el r_o r_n, DecomposeRawQueryStructureSchema_AbsR (qs_schema := qs_schema) (m := m) schemaIdx attrIdx a_proj el r_o r_n -> forall tup, UnConstrFreshIdx (GetUnConstrRelation (fst r_n) schemaIdx) (elementIndex tup) -> DecomposeRawQueryStructureSchema_AbsR schemaIdx attrIdx a_proj el (UpdateUnConstrRelation r_o schemaIdx (EnsembleInsert tup (GetUnConstrRelation r_o schemaIdx))) (UpdateUnConstrRelation (fst r_n) schemaIdx (EnsembleInsert tup (GetUnConstrRelation (fst r_n) schemaIdx)), UpdateUnConstrRelation (snd r_n) (a_proj (GetAttributeRaw (indexedElement tup) attrIdx)) (EnsembleInsert {| elementIndex := elementIndex tup; indexedElement := Tuple_DecomposeRawQueryStructure_proj _ _ a_proj (indexedElement tup) |} (GetUnConstrRelation (snd r_n) (a_proj (GetAttributeRaw (indexedElement tup) attrIdx))))).
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