Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  naecoms-o Structured version   Visualization version   GIF version

Theorem naecoms-o 34703
Description: A commutation rule for distinct variable specifiers. Version of naecoms 2479 using ax-c11 34663. (Contributed by NM, 2-Jan-2002.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypothesis
Ref Expression
nalequcoms-o.1 (¬ ∀𝑥 𝑥 = 𝑦𝜑)
Assertion
Ref Expression
naecoms-o (¬ ∀𝑦 𝑦 = 𝑥𝜑)

Proof of Theorem naecoms-o
StepHypRef Expression
1 aecom-o 34677 . . 3 (∀𝑥 𝑥 = 𝑦 → ∀𝑦 𝑦 = 𝑥)
2 nalequcoms-o.1 . . 3 (¬ ∀𝑥 𝑥 = 𝑦𝜑)
31, 2nsyl4 157 . 2 𝜑 → ∀𝑦 𝑦 = 𝑥)
43con1i 146 1 (¬ ∀𝑦 𝑦 = 𝑥𝜑)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wal 1635
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1880  ax-4 1897  ax-5 2004  ax-6 2070  ax-7 2106  ax-c5 34659  ax-c4 34660  ax-c7 34661  ax-c10 34662  ax-c11 34663  ax-c9 34666
This theorem depends on definitions:  df-bi 198  df-an 385  df-ex 1860
This theorem is referenced by:  ax12inda2ALT  34722
  Copyright terms: Public domain W3C validator