Homepage › Solution manuals › Karel Hrbáček › Introduction to Set Theory › Exercise 8.1.11
Exercise 8.1.11
Prove the following distributive laws (see Exercise 3.13 in Chapter 2).
Answers
First we show that
Proof. First let
so that we must show that .
Consider any . For any , define the set . Since we have that for all . Hence, for all , there is an such that . From this it follows that for any . Now, by the Axiom of Choice, the system of sets has a choice function . We then define a function for any , noting that this is defined for all since is nonempty. Clearly then we have, for any such , that so that . Hence is a function from into so that .
Now consider any specific so that and hence by the definition of . Thus since was arbitrary this shows that . Moreover, since we clearly have that . Thus, since was arbitrary, this shows that .
Now consider any so that there is an such that . Thus we have that for all . So consider any and let , noting that since . Thus we have that . Since we have shown that there is an such that , it follows that . Since was arbitrary we have . Hence since was arbitrary. □
Now we show that
Proof. First let
so that we must show that .
Consider any so that there is a such that . Hence we have that for all . Now consider any . Then we have that so that . Therefore there is a such that so that . Moreover, since was arbitrary, we have that . This shows that since was arbitrary.
We show this by contrapositive. So suppose that . Hence we have
Now, let for each , noting that by the above for any . Then, by the Axiom of Choice, the system of sets has a choice function . We then set for any . Then clearly for any so that since is a choice function. It then follows that is a function from into so that . Now consider any so that . Then, by the definition of , we have that . Since was arbitrary, we have thus shown that
Since was arbitrary, this shows by contrapositive that implies so that . □