Does it follow from the fact that $\exists x Fx \wedge \exists x \neg Fx$ is satisfiable that $\exists X (\exists xXx \wedge \exists x \neg Xx$) is valid?
Please help me because I can't deal with it.
Does it follow from the fact that $\exists x Fx \wedge \exists x \neg Fx$ is satisfiable that $\exists X (\exists xXx \wedge \exists x \neg Xx$) is valid?
Please help me because I can't deal with it.
I assume that you wish to know if the following holds: $$\exists x \ Fx \wedge \exists x \ \neg Fx \implies \exists X \ (\exists x \ Xx \wedge \exists x \ \neg Xx).$$ That is correct; here's why...
$Fx$ above represents a property satisfied by $x$.
The first sentence informs us that $\exists x \ Fx$ (‘$Fx$ may be true for some values of $x$’), but also $\exists x \ \neg Fx$ (‘$Fx$ may be false for some values of $x$’).
This obiviously yieds that there is some property, call it $X$ (allthough you know that $X$ is actually $F$ in disguise), such that $Xx$ can be true for some values of $x$ (‘$\exists x \ Xx$’), and false for some others (‘$\exists x \ \neg Xx$’), hence $$\exists X \ (\exists x \ Xx \wedge \exists x \ \neg Xx),$$ here you go!