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

Theorem oprabbii 6273
Description: Equivalent wff's yield equal operation class abstractions. (Contributed by NM, 28-May-1995.) (Revised by David Abernethy, 19-Jun-2012.)
Hypothesis
Ref Expression
oprabbii.1  |-  ( ph  <->  ps )
Assertion
Ref Expression
oprabbii  |-  { <. <.
x ,  y >. ,  z >.  |  ph }  =  { <. <. x ,  y >. ,  z
>.  |  ps }
Distinct variable groups:    x, z    y, z
Allowed substitution hints:    ph( x, y, z)    ps( x, y, z)

Proof of Theorem oprabbii
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 eqid 2396 . 2  |-  w  =  w
2 oprabbii.1 . . . 4  |-  ( ph  <->  ps )
32a1i 11 . . 3  |-  ( w  =  w  ->  ( ph 
<->  ps ) )
43oprabbidv 6272 . 2  |-  ( w  =  w  ->  { <. <.
x ,  y >. ,  z >.  |  ph }  =  { <. <. x ,  y >. ,  z
>.  |  ps } )
51, 4ax-mp 5 1  |-  { <. <.
x ,  y >. ,  z >.  |  ph }  =  { <. <. x ,  y >. ,  z
>.  |  ps }
Colors of variables: wff setvar class
Syntax hints:    <-> wb 184    = wceq 1399   {coprab 6219
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1633  ax-4 1646  ax-5 1719  ax-6 1765  ax-7 1808  ax-10 1855  ax-11 1860  ax-12 1872  ax-13 2020  ax-ext 2374
This theorem depends on definitions:  df-bi 185  df-an 369  df-tru 1402  df-ex 1628  df-nf 1632  df-sb 1758  df-clab 2382  df-cleq 2388  df-clel 2391  df-oprab 6222
This theorem is referenced by:  oprab4  6289  mpt2v  6313  dfxp3  6781  tposmpt2  6932  addsrpr  9385  mulsrpr  9386  addcnsr  9445  mulcnsr  9446  joinfval2  15772  meetfval2  15786
  Copyright terms: Public domain W3C validator