Homepage › Solution manuals › Karel Hrbáček › Introduction to Set Theory › Exercise 1.4.5
Exercise 1.4.5
Let and be sets.
- (a)
- Set , and prove (generalized distributive law).
- (b)
-
Set
, and prove
(generalized De Morgan’s laws).
Answers
(a) Define as above.
Proof. Consider any so that and there exists an such that . Set so that since and . Since clearly so that , and , it follows that . Hence, since and . This shows that .
Now consider any so that there is a such that . Since , it must be that for some . And since , we have that and . Then, because and , it must be that . Since also we have that , which suffices to show that as well. □
(b) Define as above.
First we show that .
Proof. Consider any so that but . It then has to be that for every since otherwise would be a member of . Now consider any so that for some . Since we know that from what has already been established. Since also , it follows that . Then, since was an arbitrary member of , it follows that , which proves that .
Next, consider any so that for every . To digress for a moment, consider any and set . Since any is also in we have and thus . Since also of course where , we have that by definition so that because . Hence, but not in since . Then, since was arbitrary and , it follows that . As it has been established that also , we have that . This suffices to show that since was arbitrary. □
Lastly, we show that .
Proof. First we note that is not empty so that exists (refer to the next exercise).
First, suppose any , implying that but . It then has to be that there is an such that since otherwise would be in . Set , noting that since but . As before, clearly . Since also and , it is necessary that . From this it follows that since we have already shown the . Therefore, since was arbitrary.
Now consider any so that there is a such that . Then, by the definition of , for some . Then, since , we have that and . Since and , it cannot be that is a member of . Since also , clearly , and hence as desired. □