Answer to Question #136815 in Discrete Mathematics for Promise Omiponle

Discrete Mathematics

Question #136815

Show that if A and B are sets where A⊆B and A is uncountable, then B is uncountable.

Expert's answer

if A⊆B, then |A|"\\leq"|B|, and so if A is uncountable, then B is uncountable(the cardinality of B is same or more).

Learn more about our help with Assignments: Discrete Math

Comments

No comments. Be the first!

Leave a comment

Related Questions

1. Show that a subset of a countable set is also countable
2. (7) An employee joined a company in 2017 with a starting salary of 50000 USD. Every y
3. Compute each of the double double sums below (a)3∑(i=1) 2∑(j=2) (i-j) (b)3∑(i=0) 2∑(j=0) (
4. What are the values of these sums, where S={1,3,5,7}? (a)∑(jϵS) j (b)∑(jϵS) j^2 (c)∑(jϵS)
5. Compute the values of the sums below. (a)5∑(k=1) (k+ 1) (b)4∑(j=0) (-2) ^j (c) 10∑(i=1) 3 (d
6. In class we showed the following: n ∑(k=1) k = n(n+1)/2 and n∑(k=1) k^2 = n(n+ 1)(2n+ 1)/6 Usi
7. Let ρ be a relation on a set A. Define ρ^−1 = {(b, a) | (a, b) ∈ ρ}. Also, for two relations