fact: Definition Diophantine {k} (R : Vector.t nat k -> Prop) := exists k', exists P1 P2 : dio_polynomial (Fin.t k') (Fin.t k), forall v : Vector.t nat k, let ρ := (fun i => Vector.nth v i) in R v <-> exists ν, dp_eval ν ρ P1 = dp_eval ν ρ P2.
imports: Coq(List) Undecidability.Shared.Libs.DLW(pos vec) Undecidability.H10.Dio(dio_single)