ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  oprabbii Unicode version

Theorem oprabbii 5943
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 2187 . 2  |-  w  =  w
2 oprabbii.1 . . . 4  |-  ( ph  <->  ps )
32a1i 9 . . 3  |-  ( w  =  w  ->  ( ph 
<->  ps ) )
43oprabbidv 5942 . 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 set class
Syntax hints:    <-> wb 105    = wceq 1363   {coprab 5889
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-11 1516  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-i5r 1545  ax-ext 2169
This theorem depends on definitions:  df-bi 117  df-tru 1366  df-nf 1471  df-sb 1773  df-clab 2174  df-cleq 2180  df-oprab 5892
This theorem is referenced by:  oprab4  5959  mpov  5978  dfxp3  6209  tposmpo  6296  oviec  6655  dfplpq2  7367  dfmpq2  7368  dfmq0qs  7442  dfplq0qs  7443  addsrpr  7758  mulsrpr  7759  addcnsr  7847  mulcnsr  7848  addvalex  7857
  Copyright terms: Public domain W3C validator