I found in the Smullyan's book "Godel's incompleteness theorems" that the following sentence is a theorem of first-order logic with identity:
$H($ n $) \equiv \forall v1(v1 = $ n $ \supset H(v1))$
where n is the numeral of n and H(v1) is a formula.
It seems very simple but I cannot find the demonstration.
Thank you.
You can prove it also with Mendelson's system (4th ed, 1997) : first-order theory with equality.
For the first "direction", we have :
We can "rearrange" it using the tautology : $( A \rightarrow (B \rightarrow C) ) \rightarrow ( B \rightarrow (A \rightarrow C) )$; so we get :
We obtain the universal closure $\forall x \forall y$ and then apply axiom (A4) [page 69], using the term $n$,to get :
then we "move inside" the quantifier with axiom (A5), because $x$ is not free in $H(n)$ :