$\mathbb Q\setminus\mathbb Z$ is diophantine over $\mathbb Q$ with $7$ unknowns

In 2016 J. Koenigsmann proved that $\mathbb Q\setminus\mathbb Z$ is diophantine over $\mathbb Q$, i.e., there is a polynomial $P(t,x_1,\ldots,x_{n})\in\mathbb Z[t,x_1,\ldots,x_{n}]$ such that for any rational number $t$ we have $$t\not\in\mathbb Z\iff \exists x_1,\ldots,x_{n}\in\mathbb Q\,[P(t,x_1,\ldots,x_{n})=0].$$ In this paper we show that we may take $n=7$ which improves the previous record $n=10$ obtained by Daans in 2024. (Actually we even extend this to any global field.) This, together with a previous result of Z.-W. Sun, implies that there is no algorithm to decide for any $F(x_1,\ldots,x_{16})\in\mathbb Z[x_1,\ldots,x_{16}]$ whether $$\forall x_1,\ldots,x_9\in\mathbb Q\exists y_1,\ldots,y_{7}\in\mathbb Q\,[F(x_1,\ldots,x_9,y_1,\ldots,y_{7})=0].$$