I have a question about counter examples I want to show for example
$\exists x ( Px \rightarrow Qx) $
is not logically equivalent to
$\exists x Px \rightarrow \exists x Qx $
I have the model
Domain=[1,2]
$P=[{1}]$
$Q=[]$
so I choose $x=2$
then
$\exists x Px \rightarrow Qx $
I got $f \rightarrow f $
so this is true
But if chose $x=1$ then $\exists x (Px \rightarrow Qx )$ is false
If $\exists x Px \rightarrow \exists Qx $
if I have x=1, x=2 then it is false
My question is for counter example do $x$ value does the have to be the same because if $x=2$
then both things are true, but if $x=1$ both statement are false.
Or it does not matter what $x$ is as long you can make one true and one false in the model.
∃x(Px→Qx)≡(∀xPx)→∃xQx– ryang Feb 11 '25 at 04:27