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

Theorem 2ax6e 2450
Description: We can always find values matching  x and  y, as long as they are represented by distinct variables. Version of 2ax6elem 2449 with a distinct variable constraint. (Contributed by Wolf Lammen, 28-Sep-2018.)
Assertion
Ref Expression
2ax6e  |-  E. z E. w ( z  =  x  /\  w  =  y )
Distinct variable group:    z, w

Proof of Theorem 2ax6e
StepHypRef Expression
1 aeveq 1982 . . . 4  |-  ( A. w  w  =  z  ->  z  =  x )
2 aeveq 1982 . . . 4  |-  ( A. w  w  =  z  ->  w  =  y )
31, 2jca 554 . . 3  |-  ( A. w  w  =  z  ->  ( z  =  x  /\  w  =  y ) )
4 19.8a 2052 . . 3  |-  ( ( z  =  x  /\  w  =  y )  ->  E. w ( z  =  x  /\  w  =  y ) )
5 19.8a 2052 . . 3  |-  ( E. w ( z  =  x  /\  w  =  y )  ->  E. z E. w ( z  =  x  /\  w  =  y ) )
63, 4, 53syl 18 . 2  |-  ( A. w  w  =  z  ->  E. z E. w
( z  =  x  /\  w  =  y ) )
7 2ax6elem 2449 . 2  |-  ( -. 
A. w  w  =  z  ->  E. z E. w ( z  =  x  /\  w  =  y ) )
86, 7pm2.61i 176 1  |-  E. z E. w ( z  =  x  /\  w  =  y )
Colors of variables: wff setvar class
Syntax hints:    /\ wa 384   A.wal 1481   E.wex 1704
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1486  df-ex 1705  df-nf 1710
This theorem is referenced by:  2sb5rf  2451  2sb6rf  2452
  Copyright terms: Public domain W3C validator