1. Other
  2. Other
  3. 3 a prove that for all sets a we have...

Question: 3 a prove that for all sets a we have...

Question details

3. (a) Prove that for all sets A, we have A~ A (b) Given sets A and B, prove that A ~ B is equivalent to B ~ A. (c) For three sets, A, B, and C, prove that if A~ B and B ~ C, then A ~ C. (Note that these three properties together prove that ~is an equivalence relation) 4. Prove that the set of finite subsets of N is a countable set.

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution