Metamath Proof Explorer


Definition df-dioph

Description: A Diophantine set is a set of positive integers which is a projection of the zero set of some polynomial. This definition somewhat awkwardly mixes ZZ (via mzPoly ) and NN0 (to define the zero sets); the former could be avoided by considering coincidence sets of NN0 polynomials at the cost of requiring two, and the second is driven by consistency with our mu-recursive functions and the requirements of the Davis-Putnam-Robinson-Matiyasevich proof. Both are avoidable at a complexity cost. In particular, it is a consequence of 4sq that implicitly restricting variables to NN0 adds no expressive power over allowing them to range over ZZ . While this definition stipulates a specific index set for the polynomials, there is actually flexibility here, see eldioph2b . (Contributed by Stefan O'Rear, 5-Oct-2014)

Ref Expression
Assertion df-dioph ⊢ Dioph = n ∈ ℕ 0 ⟼ ran ⁡ k ∈ ℤ ≥ n , p ∈ mzPoly ⁡ 1 … k ⟼ t | ∃ u ∈ ℕ 0 1 … k t = u ↾ 1 … n ∧ p ⁡ u = 0

Detailed syntax breakdown

Step Hyp Ref Expression
0 cdioph class Dioph
1 vn setvar n
2 cn0 class ℕ 0
3 vk setvar k
4 cuz class ℤ ≥
5 1 cv setvar n
6 5 4 cfv class ℤ ≥ n
7 vp setvar p
8 cmzp class mzPoly
9 c1 class 1
10 cfz class …
11 3 cv setvar k
12 9 11 10 co class 1 … k
13 12 8 cfv class mzPoly ⁡ 1 … k
14 vt setvar t
15 vu setvar u
16 cmap class ↑ 𝑚
17 2 12 16 co class ℕ 0 1 … k
18 14 cv setvar t
19 15 cv setvar u
20 9 5 10 co class 1 … n
21 19 20 cres class u ↾ 1 … n
22 18 21 wceq wff t = u ↾ 1 … n
23 7 cv setvar p
24 19 23 cfv class p ⁡ u
25 cc0 class 0
26 24 25 wceq wff p ⁡ u = 0
27 22 26 wa wff t = u ↾ 1 … n ∧ p ⁡ u = 0
28 27 15 17 wrex wff ∃ u ∈ ℕ 0 1 … k t = u ↾ 1 … n ∧ p ⁡ u = 0
29 28 14 cab class t | ∃ u ∈ ℕ 0 1 … k t = u ↾ 1 … n ∧ p ⁡ u = 0
30 3 7 6 13 29 cmpo class k ∈ ℤ ≥ n , p ∈ mzPoly ⁡ 1 … k ⟼ t | ∃ u ∈ ℕ 0 1 … k t = u ↾ 1 … n ∧ p ⁡ u = 0
31 30 crn class ran ⁡ k ∈ ℤ ≥ n , p ∈ mzPoly ⁡ 1 … k ⟼ t | ∃ u ∈ ℕ 0 1 … k t = u ↾ 1 … n ∧ p ⁡ u = 0
32 1 2 31 cmpt class n ∈ ℕ 0 ⟼ ran ⁡ k ∈ ℤ ≥ n , p ∈ mzPoly ⁡ 1 … k ⟼ t | ∃ u ∈ ℕ 0 1 … k t = u ↾ 1 … n ∧ p ⁡ u = 0
33 0 32 wceq wff Dioph = n ∈ ℕ 0 ⟼ ran ⁡ k ∈ ℤ ≥ n , p ∈ mzPoly ⁡ 1 … k ⟼ t | ∃ u ∈ ℕ 0 1 … k t = u ↾ 1 … n ∧ p ⁡ u = 0