Let $Spec(\phi)$ denotes set of cardinalities finite models of $\phi$. Show that if $\Delta$ is set of sentences such that:
- $\forall_{\phi\in\Delta} Spec(\neg\phi)\text{ is finite} \wedge$
- $\Delta\models\psi$
$ \Rightarrow$- $Spec(\neg \psi) \text{is finite}.$
My approach is following:
It is known (I don't prove it here) that there exists finite subset $\Delta_0\subseteq\Delta$ such that $\Delta_0\models\psi$. In other words we know that there exists $\Delta_0=\{\psi_1,...,\psi_k\}$ such that $(\psi_1\wedge \psi_2 \wedge ...\wedge \psi_k)\rightarrow \psi$.
It is equivalent to $\neg \psi\to (\neg \psi_1\vee \neg\psi_2 \vee ...\vee \neg\psi_k) $. Now we, now that each model of $\neg\psi$ must be model of $(\neg \psi_1\vee \neg\psi_2 \vee ...\vee \neg\psi_k)$ . We know that,
each model of $(\neg \psi_1\vee \neg\psi_2 \vee ...\vee \neg\psi_k)$ is finite because $Spec(\neg \psi_1\vee \neg\psi_2 \vee ...\vee \neg\psi_k) = Spec (\neg \psi_1)\cup...\cup Spec(\neg\psi_k)$ is finite.
Am I ok ?