## Discrete Math. (Logically equivalent)

See attachment for the question.

----------------
∀x ∈ D, if P(x) then Q(x). this means ∀x P(x) -> Q(x).
all you have to do is find a value for x
∀x this means for ALL x right
so you can choose ANY element
but for the E its only things in the domain
so all you have to do is choose an x that's not in E's domain
and then you can say therefore its not logically equivalent.

I think am wrong.

----------------
Attached Thumbnails

 PhysOrg.com science news on PhysOrg.com >> Heat-related deaths in Manhattan projected to rise>> Dire outlook despite global warming 'pause': study>> Sea level influenced tropical climate during the last ice age
 The question is a little unclear. First, you list four rules of inference for quantifiers in cut form. OK. Then, since you are talking about the all quantifier, I presume you want to refer to the first one. So, you start with $\forall$ x $\in$ D (P(x)$\Rightarrow$ Q(x)) Then, instance with c, P(c)$\Rightarrow$ Q(c). No problem here. But then you say that you can choose any c, including one not in the domain (of the quantifier, I presume you mean, in this case D), which contradicts your original statement which bounded your quantifier to D. Then you start mentioning "E": I am not sure whether you are referring to the existential quantifier $\exists$ or the set membership relation $\in$. Then you say that "it's" not logically equivalent. So far, no equivalence has been mentioned, so what is "it"? and what is it not equivalent to? Please clarify your question, and then I would be glad to help.
 ^There were two pages to what he posted. The question asks about: $\exists x ( P(x) \rightarrow Q(x) )$, and $(\forall x) P(x) \rightarrow (\exists x) Q(x)$ Are they logically equivalent? No. There is more than one way to argue it. One obvious thing to take note of is that the in the first statement, the existential binds both instances of little x. This statement can be translated as "there exists an object such that P(x) implies Q(x)" (same x) There is more than one structural difference between the first statement and the second. Can you think of any?

## Discrete Math. (Logically equivalent)

Before one could even touch the question as to whether the two statements are equivalent, one would have to make sure that they both make sense. The first one, of course, does, but the second one does not even make sense. What is meant, I think, is
$\forall$x P(x) $\rightarrow$$\exists$y Q(y).

Once that has been cleaned up, one can proceed to show that they are not equivalent.

 ^Come to think of it, nomadreid is absolutely correct. I had parsed the notation to the only thing that made sense in my mind (what you wrote), assuming it was just a strange notation. But I haven't seen it elsewhere.
 thank you guys for the help!

 Tags discrete math proofs, equivalent, inference, logically