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

Theorem aecoms-o 39927
Description: A commutation rule for identical variable specifiers. Version of aecoms 2458 using ax-c11 39912. (Contributed by NM, 10-May-1993.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypothesis
Ref Expression
alequcoms-o.1 (∀𝑥 𝑥 = 𝑦 → 𝜑)
Assertion
Ref Expression
aecoms-o (∀𝑦 𝑦 = 𝑥 → 𝜑)

Proof of Theorem aecoms-o
StepHypRef Expression
1 aecom-o 39926 . 2 (∀𝑦 𝑦 = 𝑥 → ∀𝑥 𝑥 = 𝑦)
2 alequcoms-o.1 . 2 (∀𝑥 𝑥 = 𝑦 → 𝜑)
31, 2syl 18 1 (∀𝑦 𝑦 = 𝑥 → 𝜑)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4  ∀wal 1568
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-c5 39908  ax-c4 39909  ax-c7 39910  ax-c10 39911  ax-c11 39912  ax-c9 39915
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813
This theorem is used by:  hbae-o  39928  dral1-o  39929  dvelimf-o  39954  aev-o  39956  ax12indalem  39970  ax12inda2ALT  39971
  Copyright terms: Public domain W3C validator