Monday, 11 July 2016

elementary set theory - Prove that for any two sets |X| and |Y|, either |X|leq|Y| or |Y|leq|X|.


Prove that for any two sets |X| and |Y|, either |X||Y| or |Y||X|.




I know that there is a proof using Zorn's Lemma but I can't figure out how to do it.

No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find limh0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...