Theorem naecoms 2450

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

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

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1805  ax-4 1819  ax-5 1920  ax-6 1977  ax-7 2018  ax-10 2165  ax-12 2202  ax-13 2393

This theorem depends on definitions:  df-bi 209  df-an 399  df-ex 1790  df-nf 1794

This theorem is referenced by:  sb9  2540  eujustALT  2589  nfcvf2  2941  axpowndlem2  10542  axsepg2  35381  axsepg4  35384  axnulg  35386  axpowg2  35388  axpowg3  35389  axtcond  36776  mh-setindnd  36835  wl-sbcom2d  38002  wl-mo2df  38011  wl-eudf  38013