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

Theorem hbnae 2469
Description: All variables are effectively bound in a distinct variable specifier. Lemma L19 in [Megill] p. 446 (p. 14 of the preprint). (Contributed by NM, 13-May-1993.)
Assertion
Ref Expression
hbnae (¬ ∀𝑥 𝑥 = 𝑦 → ∀𝑧 ¬ ∀𝑥 𝑥 = 𝑦)

Proof of Theorem hbnae
StepHypRef Expression
1 hbae 2467 . 2 (∀𝑥 𝑥 = 𝑦 → ∀𝑧𝑥 𝑥 = 𝑦)
21hbn 2311 1 (¬ ∀𝑥 𝑥 = 𝑦 → ∀𝑧 ¬ ∀𝑥 𝑥 = 𝑦)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wal 1629
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408
This theorem depends on definitions:  df-bi 197  df-an 383  df-or 827  df-tru 1634  df-ex 1853  df-nf 1858
This theorem is referenced by:  hbnaes  2471  eujustALT  2621  bj-hbnaeb  33139  ax6e2nd  39295  ax6e2ndVD  39662  ax6e2ndeqVD  39663  ax6e2ndALT  39684  ax6e2ndeqALT  39685
  Copyright terms: Public domain W3C validator