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

Theorem nd4 10563
Description: A lemma for proving conditionless ZFC axioms. Usage of this theorem is discouraged because it depends on ax-13 2406. (Contributed by NM, 2-Jan-2002.) (New usage is discouraged.)
Assertion
Ref Expression
nd4 (∀𝑥 𝑥 = 𝑦 → ¬ ∀𝑧 𝑦𝑥)

Proof of Theorem nd4
StepHypRef Expression
1 nd3 10562 . 2 (∀𝑦 𝑦 = 𝑥 → ¬ ∀𝑧 𝑦𝑥)
21aecoms 2462 1 (∀𝑥 𝑥 = 𝑦 → ¬ ∀𝑧 𝑦𝑥)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wal 1561
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-12 2215  ax-13 2406  ax-sep 5251  ax-reg 9542
This theorem depends on definitions:  df-bi 210  df-an 401  df-ex 1803  df-nf 1807
This theorem is referenced by:  axrepnd  10567
  Copyright terms: Public domain W3C validator