 Existential bounded representation of a primitive recursive function

The graph of every primitive recursive $f:{\mathbb{N}}^k\to \mathbb{N}$ has a formulain the language of ordered rings, where every quantifier inside $\delta$ is bounded. Composition uses existentially quantified intermediate values, while primitive recursion uses a boundedly checked code for the finite sequence of intermediate values.