Homepage › Solution manuals › Karel Hrbáček › Introduction to Set Theory › Exercise 9.1.5
Exercise 9.1.5
Prove the distributive law:
Answers
Proof. Suppose that are mutually disjoint sets such that for all . Then by definition . Also suppose that is a set such that .
We claim first that . This is easy to show since, for any and , we have
We then have
as desired. We note that works since the sets are mutually disjoint. This is easy to see by considering and in where . Then, if and also , it follows that and , which cannot be since and are mutually disjoint. Hence it must be that there is no such ordered pair so that and are disjoint, which proves the result since and were arbitrary. □