(1)$\exists x \in X \ ( P(x) \implies \forall y \in X P(y) )$
(2) $\exists x\in X P(x) \implies \forall y \in X P(y)$
What’s the difference? And are they both always true?
It seems to me that the second is false, but I read that the first is true. May someone please clarify the difference? And tell me why that is the case, please?
The first one is equivalent to : $∀xPx → ∀yPy$, which is always true.
The second one is not equivalent to the first one, and is not always true. Consider the following counter-example : "if there is a number that is even, then every number is even".
To have an insight about the difference, consider what happens to the first one with the same interpretation used above : domain $\mathbb N$ and predicate symbol $P(x)$ interpreted with "$x$ is Even".
We have that $\forall y P(y)$ is False (because it is not true that every natural is Even).
But also $P(1)$ is False.
Thus, $P(1) \to \forall y P(y)$ is True (because $\text F \to \text F$ is $\text T$) and thus :
is True.
See the so-called Drinker paradox.
And see also this post for proofs of the validity of the formula.