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

Theorem opabbid 4081
Description: Equivalent wff's yield equal ordered-pair class abstractions (deduction rule). (Contributed by NM, 21-Feb-2004.) (Proof shortened by Andrew Salmon, 9-Jul-2011.)
Hypotheses
Ref Expression
opabbid.1  |-  F/ x ph
opabbid.2  |-  F/ y
ph
opabbid.3  |-  ( ph  ->  ( ps  <->  ch )
)
Assertion
Ref Expression
opabbid  |-  ( ph  ->  { <. x ,  y
>.  |  ps }  =  { <. x ,  y
>.  |  ch } )

Proof of Theorem opabbid
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 opabbid.1 . . . 4  |-  F/ x ph
2 opabbid.2 . . . . 5  |-  F/ y
ph
3 opabbid.3 . . . . . 6  |-  ( ph  ->  ( ps  <->  ch )
)
43anbi2d 684 . . . . 5  |-  ( ph  ->  ( ( z  = 
<. x ,  y >.  /\  ps )  <->  ( z  =  <. x ,  y
>.  /\  ch ) ) )
52, 4exbid 1753 . . . 4  |-  ( ph  ->  ( E. y ( z  =  <. x ,  y >.  /\  ps ) 
<->  E. y ( z  =  <. x ,  y
>.  /\  ch ) ) )
61, 5exbid 1753 . . 3  |-  ( ph  ->  ( E. x E. y ( z  = 
<. x ,  y >.  /\  ps )  <->  E. x E. y ( z  = 
<. x ,  y >.  /\  ch ) ) )
76abbidv 2397 . 2  |-  ( ph  ->  { z  |  E. x E. y ( z  =  <. x ,  y
>.  /\  ps ) }  =  { z  |  E. x E. y
( z  =  <. x ,  y >.  /\  ch ) } )
8 df-opab 4078 . 2  |-  { <. x ,  y >.  |  ps }  =  { z  |  E. x E. y
( z  =  <. x ,  y >.  /\  ps ) }
9 df-opab 4078 . 2  |-  { <. x ,  y >.  |  ch }  =  { z  |  E. x E. y
( z  =  <. x ,  y >.  /\  ch ) }
107, 8, 93eqtr4g 2340 1  |-  ( ph  ->  { <. x ,  y
>.  |  ps }  =  { <. x ,  y
>.  |  ch } )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358   E.wex 1528   F/wnf 1531    = wceq 1623   {cab 2269   <.cop 3643   {copab 4076
This theorem is referenced by:  opabbidv  4082  mpteq12f  4096  fnoprabg  5945  feqmptdf  23228  mpteq12d  24128
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264
This theorem depends on definitions:  df-bi 177  df-an 360  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-clab 2270  df-cleq 2276  df-opab 4078
  Copyright terms: Public domain W3C validator