Discrete Mathematics and Its Applications, Seventh Edition

Published by McGraw-Hill Education
ISBN 10: 0073383090
ISBN 13: 978-0-07338-309-5

Chapter 2 - Section 2.1 - Sets - Exercises - Page 126: 46

Answer

a) Assume $S \in S$ and show that $S\notin S$ b) Assume $S \notin S$ and show that $S\in S$

Work Step by Step

Given S={${x| x \notin x}$} a) Let us assume that $S \in S$ Since $S \in S$, we note that the statement $S \notin S$ is false. As $S \in S$, all the elements of S have the requirement that $x \notin x$. Since S does not satisfy the requirement, S can then not be an element of S. $$S \notin S$$ We have then derived a contradiction as it is not possible that $S \in S$ and $S\notin S$ at the same time. b) Let us assume that $S \notin S$ Since $S \notin S$, we note that the statement $S \in S$ is true. However, all the elements of S have the requirement that $x \notin x$. Since S satisfy this requirement, S has to be an element of S. $$S \in S$$ We have then derived a contradiction as it is not possible that $S \notin S$ and $S\in S$ at the same time.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.