Linked from

The 30 pages that link to Subset, each with the reason it gives.

• Empty setRelated: With no elements to violate inclusion, the empty set is a subset of every set.

• Finite setRelated: Every subset of a finite set is finite, a basic consequence of finite cardinality.

• Cantor's theoremRelated: The power set collects every subset, including the empty set and the set itself.

• Well-founded relationRelated: The definition tests every nonempty subset of the relation's domain.

• Pascal's triangleRelated: Summing a row counts all subsets of a finite set, grouped by their size.

• Hall's marriage theoremRelated: The condition must hold for every subfamily, including small and overlapping ones.

• Axiom of unionRelated: The axiom lets a family of subsets be combined into a larger set of elements.

• ElementRelated: An element of a subset is also an element of the containing set.

• Combinatorial proofRelated: Many standard identities count subsets with constraints such as size or group membership.

• Minimal elementRelated: Minimality is evaluated inside the chosen set, so restricting the set can change which elements qualify.

• Partition of a setRelated: Each block must be a subset of the set being partitioned.

• Axiom schema of specificationRelated: Specification guarantees that the defined set is a subset of the original set.

• Membership relationRelated: Its definition universally quantifies over membership in both sets.

• Ramsey's theoremRelated: The theorem seeks an infinite subset whose fixed-size subsets have one color.

• Axiom of Power SetRelated: Subsets are exactly the objects collected by the power-set axiom.

• CentralizerRelated: The chosen subset determines which elements the centralizer must commute with.

• Pascal's ruleRelated: The counting proof partitions subsets by the presence of a chosen element.

• Axiom of regularityRelated: The axiom's consequence that membership is well-founded applies to subsets of any set.

• Hockey-stick identityRelated: Counting subsets by their largest element yields the identity's summation.

• Sperner's theoremRelated: The theorem's objects are subsets ordered by containment.

• Partial permutationRelated: The domain of a partial permutation is a subset of the underlying set.