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

Theorem aev 1999
Description: A "distinctor elimination" lemma with no restrictions on variables in the consequent. (Contributed by NM, 8-Nov-2006.) Remove dependency on ax-11 1892. (Revised by Wolf Lammen, 7-Sep-2018.) Remove dependency on ax-13 2053, inspired by an idea of BJ. (Revised by Wolf Lammen, 30-Nov-2019.)
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 aevlem1 1995 . . 3  |-  ( A. x  x  =  y  ->  A. u  u  =  w )
2 ax6ev 1796 . . . 4  |-  E. u  u  =  v
3 ax-7 1839 . . . . 5  |-  ( u  =  w  ->  (
u  =  v  ->  w  =  v )
)
43aleximi 1700 . . . 4  |-  ( A. u  u  =  w  ->  ( E. u  u  =  v  ->  E. u  w  =  v )
)
52, 4mpi 21 . . 3  |-  ( A. u  u  =  w  ->  E. u  w  =  v )
6 ax5e 1750 . . 3  |-  ( E. u  w  =  v  ->  w  =  v )
71, 5, 63syl 18 . 2  |-  ( A. x  x  =  y  ->  w  =  v )
8 axc16g 1996 . 2  |-  ( A. x  x  =  y  ->  ( w  =  v  ->  A. z  w  =  v ) )
97, 8mpd 15 1  |-  ( A. x  x  =  y  ->  A. z  w  =  v )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4   A.wal 1435   E.wex 1659
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1665  ax-4 1678  ax-5 1748  ax-6 1794  ax-7 1839  ax-12 1905
This theorem depends on definitions:  df-bi 188  df-ex 1660
This theorem is referenced by:  axc16nf  2000  axc16gALT  2159  2ax6e  2245  wl-naev  31776  wl-ax11-lem2  31830
  Copyright terms: Public domain W3C validator