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

Theorem zfcndreg 10630
Description: Axiom of Regularity ax-reg 9568, reproved from conditionless ZFC axioms. Usage of this theorem is discouraged because it depends on ax-13 2403. (Contributed by NM, 15-Aug-2003.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
zfcndreg (∃𝑦 𝑦𝑥 → ∃𝑦(𝑦𝑥 ∧ ∀𝑧(𝑧𝑦 → ¬ 𝑧𝑥)))
Distinct variable group:   𝑥,𝑦,𝑧

Proof of Theorem zfcndreg
StepHypRef Expression
1 nfe1 2187 . 2 𝑦𝑦(𝑦𝑥 ∧ ∀𝑧(𝑧𝑦 → ¬ 𝑧𝑥))
2 axregnd 10617 . 2 (𝑦𝑥 → ∃𝑦(𝑦𝑥 ∧ ∀𝑧(𝑧𝑦 → ¬ 𝑧𝑥)))
31, 2exlimi 2255 1 (∃𝑦 𝑦𝑥 → ∃𝑦(𝑦𝑥 ∧ ∀𝑧(𝑧𝑦 → ¬ 𝑧𝑥)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wa 401  wal 1568  wex 1812  wcel 2145
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-13 2403  ax-ext 2734  ax-sep 5255  ax-reg 9568
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-cleq 2754  df-clel 2837  df-nfc 2911
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator