Since we already have Separation, it’s enough to show the following:
if is a functional
formula and ,
then there is
such that
|
(as before, we suppress parameters for notational ease).
We work in and
identify a name
for . Fix
such that
. Find
large enough
such that .
Consider
(,
a name). By Definability
Theorem, this is an
formula.
By Levy Reflection Theorem, find
such that is
absolute between
and .
Define
and .
Now we verify ()
holds: Fix ,
. Since
is functional,
we know that
holds in for some
. By Forcing
Theorem, there is
such that .
So .
By absoluteness, .
This means
such that .
Thus: .