Subsets: The Idea of "Everything Inside"
Imagine you have a box of coloured marbles: red, blue, green, yellow. Now take a smaller box and put only the red and blue marbles into it. That smaller collection — red and blue — is completely contained inside the original box. Every marble in the smaller box is also in the larger box.
That is the core intuition behind a subset: one set that lives entirely inside another set.
The Precise Definition
Let A and B be two sets. We say A is a subset of B, written A⊆B, if every element of A is also an element of B.
In symbols:
A⊆B⟺∀x(x∈A⇒x∈B)
Read that as: "For every x, if x belongs to A, then x belongs to B."
The symbol ⊆ is like a "less than or equal to" for sets. It allows A to be equal to B — because if A and B have exactly the same elements, then every element of A is certainly in B.
Examples to Lock It In
Example 1. Let A={2,4} and B={1,2,3,4,5}.
Check: 2∈B? Yes. 4∈B? Yes. So A⊆B.
Example 2. Let C={1,2,3} and D={1,2}.
1∈D? Yes. 2∈D? Yes. 3∈D? No. So C⊆D (read: C is not a subset of D).
Example 3. Every set is a subset of itself.
If S={a,b}, then S⊆S because every element of S is in S. This is always true.
Example 4. The empty set ∅ is a subset of every set.
Why? Because there is no element in ∅ that could possibly fail to be in any other set. The condition "every element of ∅ is in B" is vacuously true — there are zero elements to check.
A common mistake: confusing "subset" with "element".
If A={1,2} and B={1,2,3}, then A⊆B is true. But A∈B is false — A is not one of the numbers 1,2,3; it is a set. The symbol ∈ is for membership of an element, ⊆ is for containment of a set.
Proper Subset: A Stricter Version
Sometimes we want to say "A is a subset of B, but they are not equal." That is called a proper subset, written A⊂B (or sometimes A⊊B).
A⊂B⟺A⊆B and A=B …