MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  aev Unicode version

Theorem aev 1944
Description: A "distinctor elimination" lemma with no restrictions on variables in the consequent. (Contributed by NM, 8-Nov-2006.)
Assertion
Ref Expression
aev  |-  ( A. x  x  =  y  ->  A. z  w  =  v )
Distinct variable group:    x, y

Proof of Theorem aev
Dummy variable  u is distinct from all other variables.
StepHypRef Expression
1 hbae 1906 . 2  |-  ( A. x  x  =  y  ->  A. z A. x  x  =  y )
2 ax10lem5 1895 . . 3  |-  ( A. x  x  =  y  ->  A. u  u  =  v )
3 ax-8 1661 . . . 4  |-  ( u  =  w  ->  (
u  =  v  ->  w  =  v )
)
43spimv 1943 . . 3  |-  ( A. u  u  =  v  ->  w  =  v )
52, 4syl 15 . 2  |-  ( A. x  x  =  y  ->  w  =  v )
61, 5alrimih 1555 1  |-  ( A. x  x  =  y  ->  A. z  w  =  v )
Colors of variables: wff set class
Syntax hints:    -> wi 4   A.wal 1530
This theorem is referenced by:  ax16ALT2  2001  a16gALT  2002
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878
This theorem depends on definitions:  df-bi 177  df-an 360  df-tru 1310  df-ex 1532  df-nf 1535
  Copyright terms: Public domain W3C validator