I'm working through a proof of the completeness theorem for first order predicate calculus that was given in lectures and I'm stuck on proving a step that wasn't elaborated in class.
Suppose $\phi$ is a formula in first-order predicate calculus and let $\phi '$ be the formula obtained by replacing every occurrence of $c_n$ by $c_{2n}$ where the $c_i$ are the constants in our language $\mathcal{L}$.
Let $\Delta ' := \{ \phi '\ |\ \phi \in \Delta \}$
Then I want to prove:
$\Delta$ consistent $\Rightarrow$ $\Delta '$ consistent
$\Delta '$ has a model $\Rightarrow$ $\Delta $ has a model
Can someone please explain why this is the case.