axiomatic sets 30 (making a subset 2)

By axiom of separation, we are able to make a new little set whose elements are chosen from a given set.
\[ \forall x\exists y\forall y[z\in y\leftrightarrow z\in x\wedge P(x)]  \]

For example, if $P(x)$  is $z\in w$ ,then
\[ \left\{z\in x:z\in w \right\}=y=x\cap w .  \]

However, we are only able to make a few new sets by using this axiom.
We want to make a bigger set freely.

A.Fraenkel offered an alternative axiom "axiom of replacement".
\[  \forall x\exists y \forall z[z\in y\leftrightarrow \exists w[w\in x \wedge \phi(w,z)]]  \]
 ,where $\phi$ is a formula or a statement of properties or a function.

That is to say, if
\[  \forall x\in a,\quad \exists y ,\quad \phi(x,y) \]
 is satisfied, then
\[  z=\left\{ y:\phi(x,y),x\in a \right\} \]
becomes a set.

More simple, using a function $\phi(x)=y$ ,
it is possible for us to make a new set $(y\in) z$ by a given set $a$ whose elements are $x$.

A function (this is a set, too) for a given set can make a new set. it is very strong extension.

Of course, axiom of separation can be proved by axiom of replacement easily.