Theorem hbnae 2463

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 2403. Use the weaker hbnaev 2093 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 2462	. 2 ⊢ (∀𝑥 𝑥 = 𝑦 → ∀𝑧∀𝑥 𝑥 = 𝑦)
2	1	hbn 2329	1 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → ∀𝑧 ¬ ∀𝑥 𝑥 = 𝑦)

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

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-10 2175  ax-11 2191  ax-12 2212  ax-13 2403

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1572  df-ex 1809  df-nf 1813

This theorem is used by:  hbnaes  2466  eujustALT  2599  bj-hbnaeb  37483  ax6e2nd  45295  ax6e2ndVD  45644  ax6e2ndeqVD  45645  ax6e2ndALT  45666  ax6e2ndeqALT  45667