# Axiom of extensionality

In

axiomatic set theory and the branches oflogic ,mathematics , andcomputer science that use it, the**axiom of extensionality**, or**axiom of extension**, is one of theaxiom s ofZermelo-Fraenkel set theory .**Formal statement**In the

formal language of the Zermelo-Fraenkel axioms, the axiom reads::$forall\; A\; ,\; forall\; B\; ,\; (\; forall\; C\; ,\; (C\; in\; A\; iff\; C\; in\; B)\; Rightarrow\; A\; =\; B)$

or in words::

Given any set "A" and any set "B", if for every set "C", "C" is a member of "A"if and only if "C" is a member of "B", then "A" is equal to "B".(It is not really essential that "C" here be a "set" — but in**ZF**, everything is. See**Ur-elements**below for when this is violated.)The converse, $forall\; A\; ,\; forall\; B\; ,\; (A\; =\; B\; Rightarrow\; forall\; C\; ,\; (C\; in\; A\; iff\; C\; in\; B)\; )$, of this axiom follows from the substitution property of equality.

**Interpretation**To understand this axiom, note that the clause in parentheses in the symbolic statement above simply states that "A" and "B" have precisely the same members.Thus, what the axiom is really saying is that two sets are equal

if and only if they have precisely the same members.The essence of this is::A set is determined uniquely by its members.The axiom of extensionality can be used with any statement of the form$exist\; A\; ,\; forall\; B\; ,\; (B\; in\; A\; iff\; P(B)\; ,\; )$,where "P" is any unary predicate that does not mention "A" or "B", to define a unique set $A$ whose members are precisely the sets satisfying the predicate $P$.We can then introduce a new symbol for $A$; it's in this way that

definition s in ordinary mathematics ultimately work when their statements are reduced to purely set-theoretic terms.The axiom of extensionality is generally considered uncontroversial, and it or an equivalent appears in just about any alternative axiomatisation of set theory.However, it may require modifications for some purposes, as below.

**In predicate logic without equality**The axiom given above assumes that equality is a primitive symbol in

predicate logic .Some treatments of axiomatic set theory prefer to do without this, and instead treat the above statement not as an axiom but as a "definition" of equality.Then it is necessary to include the usual axioms of equality from predicate logic as axioms about this defined symbol. Most of the axioms of equality still follow from the definition; the remaining one is:$forall\; A\; ,\; forall\; B\; ,\; (\; forall\; C\; ,\; (C\; in\; A\; iff\; C\; in\; B)\; Rightarrow\; forall\; D\; ,\; (A\; in\; D\; iff\; B\; in\; D)\; ,\; )$and it becomes "this" axiom that is referred to as the axiom of extensionality in this context.**In set theory with ur-elements**An

ur-element is a member of a set that is not itself a set.In the Zermelo-Fraenkel axioms, there are no ur-elements, but some alternative axiomatisations of set theory have them.Ur-elements can be treated as a differentlogical type from sets; in this case, $B\; in\; A$ makes no sense if $A$ is an ur-element, so the axiom of extensionality simply applies only to sets.Alternatively, in untyped logic, we can require $B\; in\; A$ to be false whenever $A$ is an ur-element.In this case, the usual axiom of extensionality would imply that every ur-element is equal to the

empty set .To avoid this, we can modify the axiom of extensionality to apply only to nonempty sets, so that it reads::$forall\; A\; ,\; forall\; B\; ,\; (\; exist\; C\; ,\; (C\; in\; A)\; Rightarrow\; [\; forall\; D\; ,\; (D\; in\; A\; iff\; D\; in\; B)\; Rightarrow\; A\; =\; B\; ]\; ,\; )$

That is::Given any set "A" and any set "B", "if "A" is a nonempty set" (that is, if there exists a member "C" of "A"), "then" if "A" and "B" have precisely the same members, then they are equal.

Yet another alternative in untyped logic is to define $A$ itself to be the only element of $A$whenever $A$ is an ur-element. While this approach can serve to preserve the axiom of extensionality, the

axiom of regularity will need an adjustment instead.**References***Paul Halmos, "Naive set theory". Princeton, NJ: D. Van Nostrand Company, 1960. Reprinted by Springer-Verlag, New York, 1974. ISBN 0-387-90092-6 (Springer-Verlag edition).

*Jech, Thomas, 2003. "Set Theory: The Third Millennium Edition, Revised and Expanded". Springer. ISBN 3-540-44085-2.

*Kunen, Kenneth, 1980. "Set Theory: An Introduction to Independence Proofs". Elsevier. ISBN 0-444-86839-9.

*Wikimedia Foundation.
2010.*

### Look at other dictionaries:

**axiom of extensionality**— noun One of the axioms in axiomatic set theory, equivalent to the statement that two sets are equal if and only if they contain the same elements … Wiktionary**Axiom schema of specification**— For the separation axioms in topology, see separation axiom. In axiomatic set theory and the branches of logic, mathematics, and computer science that use it, the axiom schema of specification, axiom schema of separation, subset axiom scheme or… … Wikipedia**Axiom of infinity**— In axiomatic set theory and the branches of logic, mathematics, and computer science that use it, the axiom of infinity is one of the axioms of Zermelo Fraenkel set theory. Formal statement In the formal language of the Zermelo Fraenkel axioms,… … Wikipedia**Axiom of pairing**— In axiomatic set theory and the branches of logic, mathematics, and computer science that use it, the axiom of pairing is one of the axioms of Zermelo Fraenkel set theory. Formal statement In the formal language of the Zermelo Frankel axioms, the … Wikipedia**Axiom of empty set**— In set theory, the axiom of empty set is one of the axioms of Zermelo–Fraenkel set theory and one of the axioms of Kripke–Platek set theory. Formal statement In the formal language of the Zermelo–Fraenkel axioms, the axiom reads::exist x, forall… … Wikipedia**Axiom of union**— In axiomatic set theory and the branches of logic, mathematics, and computer science that use it, the axiom of union is one of the axioms of Zermelo Fraenkel set theory, stating that, for any set x there is a set y whose elements are precisely… … Wikipedia**Axiom of power set**— In mathematics, the axiom of power set is one of the Zermelo Fraenkel axioms of axiomatic set theory.In the formal language of the Zermelo Fraenkel axioms, the axiom reads::forall A , exists P , forall B , [B in P iff forall C , (C in B… … Wikipedia**Extensionality**— In logic, extensionality refers to principles that judge objects to be equal if they have the same external properties. It is the opposite concept of intensionality, which is concerned with whether two descriptions are intended to be the same or… … Wikipedia**extensionality**— extensionality, axiom of … Philosophy dictionary**Axiom**— This article is about logical propositions. For other uses, see Axiom (disambiguation). In traditional logic, an axiom or postulate is a proposition that is not proven or demonstrated but considered either to be self evident or to define and… … Wikipedia