I am having difficulty proving that A-B must be uncountable using proof by contradiction considering (A-B) ∪ B )
Any help?
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It only takes a minute to sign up.
Sign up to join this communityIf $A-B$ is countable, then $(A-B)\cup B$ is also countable. But $A=(A-B)\cup B$ is uncountable.