I am working through an introductory book on mathematical proofs and I have a question about an equivalence I have proven.
The exercise says to show that $$\exists x(P(x) \to Q(x))$$ is equal to $$\forall xP(x) \to \exists xQ(x)$$
I can do that with these steps: $$\exists x(P(x) \to Q(x))$$ $$\exists x(\lnot P(x) \lor Q(x))$$ $$\exists x \lnot P(x) \lor \exists x Q(x)$$ $$\lnot \forall x P(x) \lor \exists x Q(x)$$ $$\forall xP(x) \to \exists xQ(x)$$
But will someone please help me verbalize why these are equivalent? They don't seem to be, though I just showed that they are.
I thought an example might help me, so I gave $P(x)$ and $Q(x)$ these meanings:
$P(x) \Rightarrow x$ has a first name of "Sam"
$Q(x) \Rightarrow x$ has a last name of "Bishop"
I would then interpret the first statement like this:
There is a person such that if he or she has a first name of "Sam" then that person has a last name of "Bishop".
However, I would interpret the second statement like this:
If everyone has a first name of "Sam", then there is a person who has a last name of "Bishop".
The first statement is only predicated on something being true about one person, but the second statement requires that something be true for everyone. (As I understand it.) What am I missing?
The first statement says that there is at least one person such that if their first name is Sam, then their last name is Bishop. This can be true in two ways: There is a Sam Bishop, or there is somebody who is not named Sam.
Conversely if "Everyone is named Sam implies someone is a Bishop" is true, then either
In either case, there is someone such that if his name is Sam, he is a Bishop.