Chapter 5: Problem 31
For all sets \(A\) and \(B, A-(A \cap B)=A-B\).
Short Answer
Step by step solution
Key Concepts
These are the key concepts you need to understand to accurately answer the question.
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 5: Problem 31
For all sets \(A\) and \(B, A-(A \cap B)=A-B\).
These are the key concepts you need to understand to accurately answer the question.
All the tools & learning materials you need for study success - in one app.
Get started for free
Prove that for all sets \(A\) and \(B,(A \cap B)^{c}=A^{c} \cup B^{c}\). Use an element argument to prove each statement in 8-17. Assume that all sets are subsets of a universal set \(U\).
Some English adjectives are descriptive of themselves (for instance, the word polysyllabic is polysyllabic) whereas others are not (for instance, the word monosyllabic is not monosyllabic). The word heterological refers to an adjective that does not describe itself. Is heterological heterological? Explain your answer.
Assume that \(B\) is a Boolean algebra with operations \(+\) and . Give the reasons needed to fill in the blanks in the proofs, but do not use any parts of Theorem \(5.3 .2\) unless they have already been proved. You may use any part of the definition of a Boolean algebra and the results of previous exercises, however. For all \(a\) and \(b\) in \(B,(a+b) \cdot a=a\). Proof: Let \(a\) and \(b\) be any elements of \(B\). Then $$ \begin{aligned} (a+b) \cdot a &=a \cdot(a+b) & & \frac{(\mathrm{a})}{(\mathrm{b})} \\ &=a \cdot a+a \cdot b & & \frac{(\mathrm{d})}{(\mathrm{c})} \\ &=a+a \cdot b & & \frac{(\mathrm{d})}{(\mathrm{d})} \\ &=a \cdot 1+a \cdot b & & \\ &=a \cdot(1+b) & & \frac{(\mathrm{e})}{\mathrm{by} \text { exercise } 49} \\ &=a \cdot(b+1) & & \text { (f) } \\ &=a \cdot 1 & & \end{aligned} $$
$$ \text { If } U \text { denotes a universal set, then } U^{c}=\emptyset \text {. } $$
Consider the following set property: For all sets \(A, B\), and \(C,(A-B) \cup(B-C)=(A \cup B)-(B \cap C)\). a. Use an element argument to derive the property. b. Use an algebraic argument to derive the property (by applying properties from Theorem \(5.2 .2\) ). c. Comment on which method you found easier.
What do you think about this solution?
We value your feedback to improve our textbook solutions.