Skip to content

Subset

Definition

Let A,A\text{,} BB be sets. We say that AA is a subset of B,B\text{,} denoted A⊆B,A\subseteq B\text{,} if every element of AA is also an element of B,B\text{,} i.e.,

for any object x,  x∈A    ⟹    x∈B.\text{for any object }x,\; x\in A \; \implies\; x\in B.

Interpretation

A subset describes containment between collections of objects: A⊆BA\subseteq B means that whatever belongs to AA also belongs to BB. The definition allows A=BA=B.

Two panels: a disc A inside a disc B, so A is a subset of B, and a disc A that sticks out of B, with a point x in A but not in B.

In the left panel the disc AA lies entirely inside BB, so every x∈Ax\in A is also in BB. In the right panel AA sticks out of BB, and the single marked point x∈Ax\in A with x∉Bx\notin B is enough to show that A⊈BA\not\subseteq B. To prove A⊆BA\subseteq B, take an arbitrary x∈Ax\in A and show x∈Bx\in B; to disprove it, one point of AA outside BB suffices.

Since the definition is an implication, there is nothing to check when A=∅A=\varnothing, which is why the empty set is a subset of every set. Inclusion in both directions gives equality: A⊆BA\subseteq B and B⊆AB\subseteq A together mean A=BA=B. A proper subset adds the requirement A≠BA\neq B.

A common slip is to expect any two sets to be comparable, as any two numbers are under ≤\le: neither {1}⊆{2}\{1\}\subseteq\{2\} nor {2}⊆{1}\{2\}\subseteq\{1\} holds.


Key Results

  • Every set is a subset of itself.
  • Subset relations are transitive, i.e., A⊆BA\subseteq B and B⊆CB\subseteq C implies A⊆C.A\subseteq C\text{.}
  • Proper subsets exclude equality.

Examples

  • {1, 2}⊆{1, 2, 3}.\{1,\,2\}\subseteq\{1,\,2,\,3\}\text{.}
  • ∅\varnothing is a subset of every set.

Prerequisites

Sources

Symbols: element of, subset

Last updated: 20 October 2026 03:02