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

Theorem opabbid 4213
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 685 . . . . 5  |-  ( ph  ->  ( ( z  = 
<. x ,  y >.  /\  ps )  <->  ( z  =  <. x ,  y
>.  /\  ch ) ) )
52, 4exbid 1781 . . . 4  |-  ( ph  ->  ( E. y ( z  =  <. x ,  y >.  /\  ps ) 
<->  E. y ( z  =  <. x ,  y
>.  /\  ch ) ) )
61, 5exbid 1781 . . 3  |-  ( ph  ->  ( E. x E. y ( z  = 
<. x ,  y >.  /\  ps )  <->  E. x E. y ( z  = 
<. x ,  y >.  /\  ch ) ) )
76abbidv 2503 . 2  |-  ( ph  ->  { z  |  E. x E. y ( z  =  <. x ,  y
>.  /\  ps ) }  =  { z  |  E. x E. y
( z  =  <. x ,  y >.  /\  ch ) } )
8 df-opab 4210 . 2  |-  { <. x ,  y >.  |  ps }  =  { z  |  E. x E. y
( z  =  <. x ,  y >.  /\  ps ) }
9 df-opab 4210 . 2  |-  { <. x ,  y >.  |  ch }  =  { z  |  E. x E. y
( z  =  <. x ,  y >.  /\  ch ) }
107, 8, 93eqtr4g 2446 1  |-  ( ph  ->  { <. x ,  y
>.  |  ps }  =  { <. x ,  y
>.  |  ch } )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 177    /\ wa 359   E.wex 1547   F/wnf 1550    = wceq 1649   {cab 2375   <.cop 3762   {copab 4208
This theorem is referenced by:  opabbidv  4214  mpteq12f  4228  fnoprabg  6112  feqmptdf  23919  mpteq12d  25154
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1661  ax-8 1682  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939  ax-ext 2370
This theorem depends on definitions:  df-bi 178  df-an 361  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-clab 2376  df-cleq 2382  df-opab 4210
  Copyright terms: Public domain W3C validator