Users' Mathboxes Mathbox for Andrew Salmon < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  dropab2 Structured version   Unicode version

Theorem dropab2 29716
Description: Theorem to aid use of the distinctor reduction theorem with ordered pair class abstraction. (Contributed by Andrew Salmon, 25-Jul-2011.)
Assertion
Ref Expression
dropab2  |-  ( A. x  x  =  y  ->  { <. z ,  x >.  |  ph }  =  { <. z ,  y
>.  |  ph } )

Proof of Theorem dropab2
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 opeq2 4072 . . . . . . . 8  |-  ( x  =  y  ->  <. z ,  x >.  =  <. z ,  y >. )
21sps 1800 . . . . . . 7  |-  ( A. x  x  =  y  -> 
<. z ,  x >.  = 
<. z ,  y >.
)
32eqeq2d 2454 . . . . . 6  |-  ( A. x  x  =  y  ->  ( w  =  <. z ,  x >.  <->  w  =  <. z ,  y >.
) )
43anbi1d 704 . . . . 5  |-  ( A. x  x  =  y  ->  ( ( w  = 
<. z ,  x >.  /\ 
ph )  <->  ( w  =  <. z ,  y
>.  /\  ph ) ) )
54drex1 2019 . . . 4  |-  ( A. x  x  =  y  ->  ( E. x ( w  =  <. z ,  x >.  /\  ph )  <->  E. y ( w  = 
<. z ,  y >.  /\  ph ) ) )
65drex2 2020 . . 3  |-  ( A. x  x  =  y  ->  ( E. z E. x ( w  = 
<. z ,  x >.  /\ 
ph )  <->  E. z E. y ( w  = 
<. z ,  y >.  /\  ph ) ) )
76abbidv 2563 . 2  |-  ( A. x  x  =  y  ->  { w  |  E. z E. x ( w  =  <. z ,  x >.  /\  ph ) }  =  { w  |  E. z E. y
( w  =  <. z ,  y >.  /\  ph ) } )
8 df-opab 4363 . 2  |-  { <. z ,  x >.  |  ph }  =  { w  |  E. z E. x
( w  =  <. z ,  x >.  /\  ph ) }
9 df-opab 4363 . 2  |-  { <. z ,  y >.  |  ph }  =  { w  |  E. z E. y
( w  =  <. z ,  y >.  /\  ph ) }
107, 8, 93eqtr4g 2500 1  |-  ( A. x  x  =  y  ->  { <. z ,  x >.  |  ph }  =  { <. z ,  y
>.  |  ph } )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 369   A.wal 1367    = wceq 1369   E.wex 1586   {cab 2429   <.cop 3895   {copab 4361
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1591  ax-4 1602  ax-5 1670  ax-6 1708  ax-7 1728  ax-10 1775  ax-11 1780  ax-12 1792  ax-13 1943  ax-ext 2423
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 967  df-tru 1372  df-ex 1587  df-nf 1590  df-sb 1701  df-clab 2430  df-cleq 2436  df-clel 2439  df-nfc 2577  df-rab 2736  df-v 2986  df-dif 3343  df-un 3345  df-in 3347  df-ss 3354  df-nul 3650  df-if 3804  df-sn 3890  df-pr 3892  df-op 3896  df-opab 4363
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator