Chapter 2: Q21E (page 136)
Prove the first associative law from Table 1 by showing that if A, B, and C are sets, then A∪(B∪C) = (A∪B)∪C.
Short Answer
Thus, it is true \(A \cup \left( {B \cup C} \right) = \left( {A \cup B} \right) \cup C\).
Chapter 2: Q21E (page 136)
Prove the first associative law from Table 1 by showing that if A, B, and C are sets, then A∪(B∪C) = (A∪B)∪C.
Thus, it is true \(A \cup \left( {B \cup C} \right) = \left( {A \cup B} \right) \cup C\).
All the tools & learning materials you need for study success - in one app.
Get started for freeShow that is countable by showing that the polynomial function with is one-to-one and onto.
Question: a) Prove that a strictly increasing function from R to itself is one-to-one.
b) Give an example of an increasing function from R to itself is not one-to-one.
Question: Let . Find if
Let . Find f(S) if
Show that the set of odd integers is countable
What do you think about this solution?
We value your feedback to improve our textbook solutions.