Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I just want to make sure I'm negating the following logical statement correctly (for a contradiction proof):

For every set $A$, there exists a well ordered set $V$ such that there exists no surjection $\pi: A \rightarrow V$.

I'm negating this as:

For every set $A$, there exists a well ordered set $V$ such that there exists a surjection $\pi: A \rightarrow V$.

Is this a correct negation?

share|cite|improve this question
up vote 5 down vote accepted

No. You've only negated one part of the statement. Negating each part:

There exists a set $A$ so that for all well-ordered sets $V$ there exists a surjection $\pi:A\to V$.

I think I've negated what you're actually going for here.

share|cite|improve this answer
Thank you. This is actually exactly what I was hoping it would be. – Zermie Feb 16 '14 at 7:49

That is not a correct negation. Quantifiers switch when you negate. As such, the "for every" becomes a "there exists...such that", the "there exists" becomes a "for every", and "such that" is deleted for grammar reasons.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.