I am having difficulty proving that A-B must be uncountable using proof by contradiction considering (A-B) ∪ B )

Any help?


1 Answer 1


If $A-B$ is countable, then $(A-B)\cup B$ is also countable. But $A=(A-B)\cup B$ is uncountable.

  • $\begingroup$ In general, $A\neq(A-B)\cup B$. But $A\subset(A-B)\cup B$, which is enough. $\endgroup$
    – TonyK
    Sep 18, 2016 at 17:44

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.