Theorem naecoms 2460

Description: A commutation rule for distinct variable specifiers. Usage of this theorem is discouraged because it depends on ax-13 2403. (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 2458	. 2 ⊢ (∀𝑥 𝑥 = 𝑦 ↔ ∀𝑦 𝑦 = 𝑥)
2		naecoms.1	. 2 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → 𝜑)
3	1, 2	sylnbir 334	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-12 2212  ax-13 2403

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

This theorem is used by:  sb9  2550  eujustALT  2599  nfcvf2  2951  axpowndlem2  10589  axsepg2  35561  axsepg4  35564  axnulg  35566  axpowg2  35568  axpowg3  35569  axtcond  37017  mh-setindnd  37076  wl-sbcom2d  38244  wl-mo2df  38253  wl-eudf  38255