B is a proper subset of C if B is not empty and C contains something not in B.
What is the least number of elements B can have and not be empty?
What is the most number of elements B can have if C has some element not in B?
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.