HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Axiom ax-reg 4653
Description: Axiom of Regularity. An axiom of Zermelo-Fraenkel set theory. Also called the Axiom of Foundation. A rather non-intuitive axiom that denies more than it asserts, it states (in the form of zfreg 4656) that every non-empty set contains a set disjoint from itself. One consequence is that it denies the existence of a set containing itself (elirrv 4658). A stronger version that works for proper classes is proved as zfregs 4709.
Assertion
Ref Expression
ax-reg |- (E.y y e. x -> E.y(y e. x /\ A.z(z e. y -> -. z e. x)))
Distinct variable group:   x,y,z

Detailed syntax breakdown of Axiom ax-reg
StepHypRef Expression
1 vy . . . . 5 set y
21cv 996 . . . 4 class y
3 vx . . . . 5 set x
43cv 996 . . . 4 class x
52, 4wcel 999 . . 3 wff y e. x
65, 1wex 1021 . 2 wff E.y y e. x
7 vz . . . . . . . 8 set z
87cv 996 . . . . . . 7 class z
98, 2wcel 999 . . . . . 6 wff z e. y
108, 4wcel 999 . . . . . . 7 wff z e. x
1110wn 2 . . . . . 6 wff -. z e. x
129, 11wi 3 . . . . 5 wff (z e. y -> -. z e. x)
1312, 7wal 995 . . . 4 wff A.z(z e. y -> -. z e. x)
145, 13wa 230 . . 3 wff (y e. x /\ A.z(z e. y -> -. z e. x))
1514, 1wex 1021 . 2 wff E.y(y e. x /\ A.z(z e. y -> -. z e. x))
166, 15wi 3 1 wff (E.y y e. x -> E.y(y e. x /\ A.z(z e. y -> -. z e. x)))
Colors of variables: wff set class
This axiom is referenced by:  axreg 4654
Copyright terms: Public domain