Theorem naecoms 2426

Description: A commutation rule for distinct variable specifiers. Usage of this theorem is discouraged because it depends on ax-13 2369. (Contributed by NM, 2-Jan-2002.) (New usage is discouraged.)

Hypothesis

Ref	Expression
naecoms.1	⊢ (¬ ∀𝑥 𝑥 = 𝑦 → 𝜑)

Assertion

Ref	Expression
naecoms	⊢ (¬ ∀𝑦 𝑦 = 𝑥 → 𝜑)

Proof of Theorem naecoms

Step	Hyp	Ref	Expression
1		aecom 2424	. 2 ⊢ (∀𝑥 𝑥 = 𝑦 ↔ ∀𝑦 𝑦 = 𝑥)
2		naecoms.1	. 2 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → 𝜑)
3	1, 2	sylnbir 330	1 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → 𝜑)

Syntax hints:  ¬ wn 3   → wi 4  ∀wal 1537

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-10 2135  ax-12 2169  ax-13 2369

This theorem depends on definitions:  df-bi 206  df-an 395  df-ex 1780  df-nf 1784

This theorem is referenced by:  sb9  2516  eujustALT  2564  nfcvf2  2931  axpowndlem2  10595  wl-sbcom2d  36729  wl-mo2df  36738  wl-eudf  36740