How does one generally show syntactical statements in PA about primitive recursive functions or relations?
For example something like:
Let $A$ be a prim. rec. relation such that $n\in A$ for every numeral $n$. Show $PA \vdash \forall x A(x)$ (where $A$ denotes the relation as well as the formula representing the relation in PA).