Question

1. Is empty set subset to every set?
2. Is any set subset to itself?
3. You are given two sets such that a set is not a subset of the other. If you have to prove
this, how do you prove?
Justify your answers​

Answer 1

Answer:

Each set only includes it once as a subset, not an infinite number of times. ... If A is the empty set, there are no xs in A, so in particular there are no xs in A that are not ... (From a wider standpoint, you can think of the empty set as the set for which ... cardinality are in a sense the same, you just title finite sets by their cardinality.

Step-by-step explanation:

Answer 2

Proving Set Equality. One way to prove that two sets are equal is to use Theorem 5.2 and prove each of the two sets is a subset of the other set. In particular, let A and B be subsets of some universal set. Theorem 5.2 states that A=B if and only if A⊆B and B⊆A.

Also, the empty set is a subset of every set, because every element in the empty set belongs to any set since the empty set has no elements. Listing Subsets: List all the subsets of {a, b, c}. Example: The set {a, b, c} has 8 subsets.

tq