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.2 - Set Operations - Exercises - Page 137: 31

Answer

See step by step work for solution

Work Step by Step

To proof: $A \subseteq B$ if and only if $\bar B \subseteq \bar A$ Proof: By the definition of a subset. $A \subseteq B$ is logically equivalent with all elements for which: if $x$ is an element of $A$, then $x$ is an element of $B$. $A \subseteq B \equiv \forall x(x \in A \rightarrow x \in B)$ Use logical equivalence $(p\rightarrow q) \equiv (\neg q\rightarrow \neg p)$ $ \equiv \forall x(\neg (x \in B) \rightarrow \neg (x \in A))$ By the definition of the complement: $ \equiv \forall x((x \in \bar B) \rightarrow (x \in \bar A))$ By the definition of the set $\equiv \bar B \subseteq \bar A$ Since $A \subseteq B$ is logically equivalent with $\bar B \subseteq \bar A$, $A \subseteq B \leftrightarrow \bar B \subseteq \bar A$ is a tautology, $$A \subseteq B \leftrightarrow \bar B \subseteq \bar A$$ Hence, $A \subseteq B$ if and only if $\bar B \subseteq \bar A$
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.