|Description: Axiom of Extensionality.
It states that two sets are identical if they
contain the same elements. Axiom 1 of [Crosilla] p. "Axioms of CZF and
IZF" (with unnecessary quantifiers removed).
Set theory can also be formulated with a single primitive
∈ on top of
traditional predicate calculus without equality. In
that case the Axiom of Extensionality becomes
(∀w(w ∈ x ↔
y) → (x ∈ z → y ∈ z)),
equality x =
y is defined as ∀w(w ∈ x ↔
of the usual axioms of equality then become theorems of set theory.
See, for example, Axiom 1 of [TakeutiZaring] p. 8.
To use the above "equality-free" version of Extensionality
Metamath's logical axioms, we would rewrite ax-8 1369
through ax-16 1669 with
equality expanded according to the above definition. Some of those
axioms could be proved from set theory and would be redundant. Not all
of them are redundant, since our axioms of predicate calculus make
essential use of equality for the proper substitution that is a
primitive notion in traditional predicate calculus. A study of such an
axiomatization would be an interesting project for someone exploring the
foundations of logic.
It is important to understand that strictly speaking, all of our set
theory axioms are really schemes that represent an infinite number of
actual axioms. This is inherent in the design of Metamath
("metavariable math"), which manipulates only metavariables.
example, the metavariable x in ax-ext 1996 can represent any actual
variable v1, v2, v3,... . Distinct variable
prevent us from substituting say v1 for both x and z. This
is in contrast to typical textbook presentations that present actual
axioms (except for axioms which involve wff metavariables). In
practice, though, the theorems and proofs are essentially the same. The
$d restrictions make each of the infinite axioms generated by the
ax-ext 1996 scheme exactly logically equivalent to each
other and in
particular to the actual axiom of the textbook version. (Contributed by