Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  naecoms Structured version   Visualization version   GIF version

Theorem naecoms 2301
 Description: A commutation rule for distinct variable specifiers. (Contributed by NM, 2-Jan-2002.)
Hypothesis
Ref Expression
naecoms.1 (¬ ∀𝑥 𝑥 = 𝑦𝜑)
Assertion
Ref Expression
naecoms (¬ ∀𝑦 𝑦 = 𝑥𝜑)

Proof of Theorem naecoms
StepHypRef Expression
1 aecom 2299 . 2 (∀𝑥 𝑥 = 𝑦 ↔ ∀𝑦 𝑦 = 𝑥)
2 naecoms.1 . 2 (¬ ∀𝑥 𝑥 = 𝑦𝜑)
31, 2sylnbir 320 1 (¬ ∀𝑦 𝑦 = 𝑥𝜑)
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4  ∀wal 1473 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-12 2034  ax-13 2234 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-tru 1478  df-ex 1696  df-nf 1701 This theorem is referenced by:  sb9  2414  eujustALT  2461  nfcvf2  2775  axpowndlem2  9299  wl-sbcom2d  32523  wl-mo2df  32531  wl-eudf  32533
 Copyright terms: Public domain W3C validator