Subset Checker – Is A a Subset of B?

Check if one set is a subset, proper subset, or equal to another with our free online subset checker. Instantly verify subset relationships with clear explanations.

Set A (comma or space separated)

Set B (comma or space separated)

Examples:

Understanding Subsets

A subset is a set whose elements are all contained within another set. If every element of set A is also an element of set B, then A is a subset of B. Think of it like categories: all poodles are dogs, so the set of poodles is a subset of the set of dogs.

Set theory forms the foundation of modern mathematics. Subsets help us understand relationships between groups, classify objects, and build logical arguments. From database queries to programming conditions, subset relationships appear everywhere in computing and logic.

Subset Notation and Definitions

Subset (⊆)

A ⊆ B means every element of A is also in B. A can equal B.

A = {1, 2}, B = {1, 2, 3} → A ⊆ B ✓

Proper Subset (⊂)

A ⊂ B means A is a subset of B, but A ≠ B. A has fewer elements.

A = {1, 2}, B = {1, 2, 3} → A ⊂ B ✓

Superset (⊇)

A ⊇ B means B is a subset of A. A contains all elements of B.

A = {1, 2, 3}, B = {1, 2} → A ⊇ B ✓

Equal Sets (=)

A = B means they contain exactly the same elements.

A = {1, 2, 3}, B = {3, 2, 1} → A = B ✓

Worked Examples

Example 1: Basic subset

Problem: Is A = {1, 2, 3} a subset of B = {1, 2, 3, 4, 5}?

Solution: Check each element of A:

1 ∈ B? Yes. 2 ∈ B? Yes. 3 ∈ B? Yes.

All elements of A are in B, so A ⊆ B. Since B has extra elements, A ⊂ B (proper subset).

Example 2: Not a subset

Problem: Is A = {1, 5, 7} a subset of B = {1, 2, 3, 4}?

Solution: Check each element of A:

1 ∈ B? Yes. 5 ∈ B? No! Stop here.

Since 5 is not in B, A is NOT a subset of B.

Example 3: Equal sets

Problem: Is A = {a, b, c} a subset of B = {c, b, a}?

Solution: Order doesn't matter in sets. Both contain exactly a, b, c.

A ⊆ B? Yes. B ⊆ A? Also yes.

Therefore A = B. A is a subset but NOT a proper subset.

Example 4: Empty set

Problem: Is ∅ (empty set) a subset of B = {1, 2, 3}?

Solution: The empty set has no elements, so there's nothing to check.

By definition, the empty set is a subset of every set. ∅ ⊆ B is always true.

Example 5: Superset relationship

Problem: A = {1, 2, 3, 4, 5}, B = {2, 4}. What's the relationship?

Solution: Check if B ⊆ A: 2 ∈ A? Yes. 4 ∈ A? Yes.

B is a proper subset of A (B ⊂ A).

Equivalently, A is a superset of B (A ⊇ B).

Quick Fact

Georg Cantor (1845-1918) founded set theory and revolutionized mathematics by treating infinite sets rigorously. His work on subsets led to the shocking discovery that some infinities are larger than others. The set of real numbers is "uncountably infinite" – it has more elements than the set of natural numbers, even though both are infinite. This insight shocked 19th-century mathematicians.

Key Properties of Subsets

Reflexive Property

Every set is a subset of itself.

A ⊆ A (always true)

Transitive Property

If A is a subset of B, and B is a subset of C, then A is a subset of C.

If A ⊆ B and B ⊆ C, then A ⊆ C

Empty Set Property

The empty set is a subset of every set.

∅ ⊆ A (for any set A)

Subset and Equality

Two sets are equal if and only if each is a subset of the other.

A = B if and only if A ⊆ B and B ⊆ A

Frequently Asked Questions

What's the difference between ⊆ and ⊂?

⊆ (subset or equal) allows the sets to be identical. ⊂ (proper subset) requires A to be strictly smaller than B. If A = {1,2} and B = {1,2}, then A ⊆ B is true, but A ⊂ B is false.

Is every set a subset of itself?

Yes! Every set A satisfies A ⊆ A. This is the reflexive property. However, no set is a proper subset of itself – A ⊂ A is always false.

Why is the empty set a subset of every set?

It's vacuously true. To prove ∅ is NOT a subset of A, you'd need to find an element in ∅ that's not in A. But ∅ has no elements, so you can't. Therefore, ∅ ⊆ A is true for any A.

Does order matter in sets?

No. {1, 2, 3} and {3, 2, 1} are the same set. Sets are defined only by which elements they contain, not the order. This is different from sequences or tuples where order matters.

Can a set contain itself as an element?

In standard set theory (ZFC), no – this leads to Russell's Paradox. The set of all sets that don't contain themselves creates a logical contradiction. Modern set theory avoids this by restricting how sets can be formed.

How many subsets does a set have?

A set with n elements has 2ⁿ subsets (the power set). For example, {a, b, c} has 2³ = 8 subsets: ∅, {a}, {b}, {c}, {a,b}, {a,c}, {b,c}, {a,b,c}. This includes the empty set and the set itself.

Other Free Tools

Search tools