fact: Definition DecomposeRawQueryStructureSchema_Insert_AbsR_neq {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 Ridx tup, Ridx <> schemaIdx -> DecomposeRawQueryStructureSchema_AbsR schemaIdx attrIdx a_proj el (UpdateUnConstrRelation r_o Ridx (EnsembleInsert tup (GetUnConstrRelation r_o Ridx))) (UpdateUnConstrRelation (fst r_n) Ridx (EnsembleInsert tup (GetUnConstrRelation (fst r_n) Ridx)), snd 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