Prove: Let . Then is at most countable. Let , and let . Then and . So basically after removing the first smallest element, , then is the second smallest element, etc.. Is this on the right track? Could I maybe let , and and (e.g. take away the maximum elements)?