Theorem hbnae 2464

Description: All variables are effectively bound in a distinct variable specifier. Lemma L19 in [Megill] p. 446 (p. 14 of the preprint). Usage of this theorem is discouraged because it depends on ax-13 2404. Use the weaker hbnaev 2099 when possible. (Contributed by NM, 13-May-1993.) (New usage is discouraged.)

Assertion

Ref	Expression
hbnae	⊢ (¬ ∀𝑥 𝑥 = 𝑦 → ∀𝑧 ¬ ∀𝑥 𝑥 = 𝑦)

Proof of Theorem hbnae

Step	Hyp	Ref	Expression
1		hbae 2463	. 2 ⊢ (∀𝑥 𝑥 = 𝑦 → ∀𝑧∀𝑥 𝑥 = 𝑦)
2	1	hbn 2332	1 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → ∀𝑧 ¬ ∀𝑥 𝑥 = 𝑦)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4  ∀wal 1568

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 1945  ax-6 2002  ax-7 2043  ax-10 2180  ax-11 2197  ax-12 2216  ax-13 2404

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817

This theorem is used by:  hbnaes  2467  eujustALT  2600  bj-hbnaeb  37909  ax6e2nd  45730  ax6e2ndVD  46079  ax6e2ndeqVD  46080  ax6e2ndALT  46101  ax6e2ndeqALT  46102