# Category:Axioms/Zermelo-Fraenkel Axioms

This category contains axioms related to Zermelo-Fraenkel Axioms.
Related results can be found in Category:Zermelo-Fraenkel Axioms.

### The Axiom of Extension

Let $A$ and $B$ be sets.

The Axiom of Extension states that:

$A$ and $B$ are equal
they contain the same elements.

That is, if and only if:

every element of $A$ is also an element of $B$

and:

every element of $B$ is also an element of $A$.

This can be formulated as follows:

$\forall x: \paren {x \in A \iff x \in B} \iff A = B$

### The Axiom of the Empty Set

$\exists x: \forall y \in x: y \ne y$

### The Axiom of Pairing

For any two sets, there exists a set to which only those two sets are elements:

$\forall a: \forall b: \exists c: \forall z: \paren {z = a \lor z = b \iff z \in c}$

### The Axiom of Specification

For any well-formed formula $\map P y$, we introduce the axiom:

$\forall z: \exists x: \forall y: \paren {y \in x \iff \paren {y \in z \land \map P y} }$

where each of $x$, $y$ and $z$ range over arbitrary sets.

### The Axiom of Unions

For every set of sets $A$, there exists a set $x$ (the union set) that contains all and only those elements that belong to at least one of the sets in the $A$:

$\forall A: \exists x: \forall y: \paren {y \in x \iff \exists z: \paren {z \in A \land y \in z} }$

### The Axiom of Powers

For every set, there exists a set of sets whose elements are all the subsets of the given set.

$\forall x: \exists y: \paren {\forall z: \paren {z \in y \iff \paren {w \in z \implies w \in x} } }$

### The Axiom of Infinity

There exists a set containing:

$(1): \quad$ a set with no elements
$(2): \quad$ the successor of each of its elements.

That is:

$\exists x: \paren {\paren {\exists y: y \in x \land \forall z: \neg \paren {z \in y} } \land \forall u: u \in x \implies u^+ \in x}$

### The Axiom of Replacement

For every mapping $f$ and subset $S$ of the domain of $f$, there exists a set containing the image $f \sqbrk S$.

More formally, let us express this as follows:

Let $\map P {x, z}$ be a propositional function, which determines a mapping.

That is, we have:

$\forall x: \exists ! y : \map P {x, y}$.

Then we state as an axiom:

$\forall A: \exists B: \forall y: \paren {y \in B \iff \exists x \in A : \map P {x, y} }$

### The Axiom of Foundation

For all non-empty sets, there is an element of the set that shares no element with the set.

That is:

$\forall S: \paren {\paren {\exists x: x \in S} \implies \exists y \in S: \forall z \in S: \neg \paren {z \in y} }$

The antecedent states that $S$ is not empty.

## Subcategories

This category has the following 9 subcategories, out of 9 total.

## Pages in category "Axioms/Zermelo-Fraenkel Axioms"

The following 29 pages are in this category, out of 29 total.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.981769323348999, "perplexity": 501.18228408282215}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2023-06/segments/1674764499891.42/warc/CC-MAIN-20230131222253-20230201012253-00857.warc.gz"}