Metamath Proof Explorer


Theorem zfreg

Description: The Axiom of Regularity using abbreviations. Axiom 6 of TakeutiZaring p. 21. This is called the "weak form". Axiom Reg of BellMachover p. 480. There is also a "strong form", not requiring that A be a set, that can be proved with more difficulty (see zfregs ). (Contributed by NM, 26-Nov-1995) Replace sethood hypothesis with sethood antecedent. (Revised by BJ, 27-Apr-2021)

Ref Expression
Assertion zfreg A V A x A x A =

Proof

Step Hyp Ref Expression
1 n0 A x x A
2 1 biimpi A x x A
3 2 anim2i A V A A V x x A
4 zfregcl A V x x A x A y x ¬ y A
5 4 imp A V x x A x A y x ¬ y A
6 disj x A = y x ¬ y A
7 6 rexbii x A x A = x A y x ¬ y A
8 7 biimpri x A y x ¬ y A x A x A =
9 3 5 8 3syl A V A x A x A =