MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  zfregcl Structured version   Visualization version   GIF version

Theorem zfregcl 9552
Description: The Axiom of Regularity with class variables. (Contributed by NM, 5-Aug-1994.) Replace sethood hypothesis with sethood antecedent. (Revised by BJ, 27-Apr-2021.) Avoid ax-10 2176 and ax-12 2213. (Revised by TM, 31-Dec-2025.)
Assertion
Ref Expression
zfregcl (𝐴𝑉 → (∃𝑥 𝑥𝐴 → ∃𝑥𝐴𝑦𝑥 ¬ 𝑦𝐴))
Distinct variable group:   𝑥,𝐴,𝑦
Allowed substitution hints:   𝑉(𝑥,𝑦)

Proof of Theorem zfregcl
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 eleq2 2852 . . . 4 (𝑧 = 𝐴 → (𝑥𝑧𝑥𝐴))
21exbidv 1951 . . 3 (𝑧 = 𝐴 → (∃𝑥 𝑥𝑧 ↔ ∃𝑥 𝑥𝐴))
3 eleq2 2852 . . . . . 6 (𝑧 = 𝐴 → (𝑦𝑧𝑦𝐴))
43notbid 321 . . . . 5 (𝑧 = 𝐴 → (¬ 𝑦𝑧 ↔ ¬ 𝑦𝐴))
54ralbidv 3188 . . . 4 (𝑧 = 𝐴 → (∀𝑦𝑥 ¬ 𝑦𝑧 ↔ ∀𝑦𝑥 ¬ 𝑦𝐴))
65rexeqbi1dv 3334 . . 3 (𝑧 = 𝐴 → (∃𝑥𝑧𝑦𝑥 ¬ 𝑦𝑧 ↔ ∃𝑥𝐴𝑦𝑥 ¬ 𝑦𝐴))
72, 6imbi12d 347 . 2 (𝑧 = 𝐴 → ((∃𝑥 𝑥𝑧 → ∃𝑥𝑧𝑦𝑥 ¬ 𝑦𝑧) ↔ (∃𝑥 𝑥𝐴 → ∃𝑥𝐴𝑦𝑥 ¬ 𝑦𝐴)))
8 ax-reg 9550 . . 3 (∃𝑥 𝑥𝑧 → ∃𝑥(𝑥𝑧 ∧ ∀𝑦(𝑦𝑥 → ¬ 𝑦𝑧)))
9 df-ral 3080 . . . . 5 (∀𝑦𝑥 ¬ 𝑦𝑧 ↔ ∀𝑦(𝑦𝑥 → ¬ 𝑦𝑧))
109rexbii 3112 . . . 4 (∃𝑥𝑧𝑦𝑥 ¬ 𝑦𝑧 ↔ ∃𝑥𝑧𝑦(𝑦𝑥 → ¬ 𝑦𝑧))
11 df-rex 3090 . . . 4 (∃𝑥𝑧𝑦(𝑦𝑥 → ¬ 𝑦𝑧) ↔ ∃𝑥(𝑥𝑧 ∧ ∀𝑦(𝑦𝑥 → ¬ 𝑦𝑧)))
1210, 11bitr2i 279 . . 3 (∃𝑥(𝑥𝑧 ∧ ∀𝑦(𝑦𝑥 → ¬ 𝑦𝑧)) ↔ ∃𝑥𝑧𝑦𝑥 ¬ 𝑦𝑧)
138, 12sylib 221 . 2 (∃𝑥 𝑥𝑧 → ∃𝑥𝑧𝑦𝑥 ¬ 𝑦𝑧)
147, 13vtoclg 3522 1 (𝐴𝑉 → (∃𝑥 𝑥𝐴 → ∃𝑥𝐴𝑦𝑥 ¬ 𝑦𝐴))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 400  wal 1568   = wceq 1570  wex 1809  wcel 2143  wral 3079  wrex 3089
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-reg 9550
This theorem depends on definitions:  df-bi 210  df-an 401  df-tru 1573  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090
This theorem is referenced by:  zfreg  9554  elirrvOLDOLD  9557
  Copyright terms: Public domain W3C validator