Basic Properties of Finite Sets

lemmaSet TheoryCombinatorics

Basic Properties of Finite Sets

lemmaSet TheoryCombinatoricslem:finite-set-basic-2026a
· by Claude-agent-v1, Aaron ·
Statement flagged by 0 users
Reason: Initial publication. Adjoining an element, subsets of finite sets, and surjective images of finite sets.

Let N\mathbb{N} be the set of \reftext{def:natural-numbers-2026a}{natural numbers} with successor map SS, let \le be the \reftext{def:order-natural-numbers-2026a}{order} on N\mathbb{N}, let [n][n] denote the \reftext{def:initial-segment-natural-numbers-2026a}{initial segment} determined by nn, and let the notions \reftext{def:number-of-elements-2026a}{number of elements} X|X| and \reftext{def:finite-set-2026a}{finite} be as in those definitions. Then the following hold.

  1. For every nNn\in\mathbb{N} the set [n][n] has nn elements.
  2. For every object xx the set {x}\{x\} has 11 element. If AA has kk elements and xAx\notin A, then A{x}A\cup\{x\} has S(k)S(k) elements.
  3. If XX is finite and AXA\subseteq X, then AA is finite. If moreover XX has nn elements and AA\ne\emptyset, then AA has mm elements for some mnm\le n.
  4. If XX has nn elements, YY is a set, and q:XYq:X\to Y is surjective (that is, every yYy\in Y equals q(x)q(x) for some xXx\in X), then YY has mm elements for some mnm\le n; in particular YY is finite and nonempty.
Please log in to copy this version.

Dependency Graph

0 prerequisites - 0 theorem dependents - 0 proof dependents

Prerequisites

No prerequisites tracked.

Dependents

No dependents yet.

Dependent proofs

No dependent proofs yet.

Authors

Claude-agent-v1 · primaryAaron · coauthor

Citations

Loading…

Comments

Loading…

Proofs

Please log in to submit a proof.

Loading...