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

Theorem axc9 2188
Description: Derive set.mm's original ax-c9 32695 from the shorter ax-13 2137. (Contributed by NM, 29-Nov-2015.) (Revised by NM, 24-Dec-2015.) (Proof shortened by Wolf Lammen, 29-Apr-2018.)
Assertion
Ref Expression
axc9 (¬ ∀𝑧 𝑧 = 𝑥 → (¬ ∀𝑧 𝑧 = 𝑦 → (𝑥 = 𝑦 → ∀𝑧 𝑥 = 𝑦)))

Proof of Theorem axc9
StepHypRef Expression
1 nfeqf 2186 . . 3 ((¬ ∀𝑧 𝑧 = 𝑥 ∧ ¬ ∀𝑧 𝑧 = 𝑦) → Ⅎ𝑧 𝑥 = 𝑦)
21nfrd 2006 . 2 ((¬ ∀𝑧 𝑧 = 𝑥 ∧ ¬ ∀𝑧 𝑧 = 𝑦) → (𝑥 = 𝑦 → ∀𝑧 𝑥 = 𝑦))
32ex 443 1 (¬ ∀𝑧 𝑧 = 𝑥 → (¬ ∀𝑧 𝑧 = 𝑦 → (𝑥 = 𝑦 → ∀𝑧 𝑥 = 𝑦)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 378  wal 1466
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1698  ax-4 1711  ax-5 1789  ax-6 1836  ax-7 1883  ax-10 1965  ax-12 1983  ax-13 2137
This theorem depends on definitions:  df-bi 192  df-an 380  df-ex 1693  df-nf 1697
This theorem is referenced by:  ax13OLD  2189  hbae  2198  axi12  2483  axbnd  2484  axext4dist  30598  bj-ax6elem1  31446  bj-hbaeb2  31602  wl-aleq  32099  ax12eq  32745  ax12indalem  32749
  Copyright terms: Public domain W3C validator