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

Theorem oprabbid 5586
Description: Equivalent wff's yield equal operation class abstractions (deduction rule). (Contributed by NM, 21-Feb-2004.) (Revised by Mario Carneiro, 24-Jun-2014.)
Hypotheses
Ref Expression
oprabbid.1  |-  F/ x ph
oprabbid.2  |-  F/ y
ph
oprabbid.3  |-  F/ z
ph
oprabbid.4  |-  ( ph  ->  ( ps  <->  ch )
)
Assertion
Ref Expression
oprabbid  |-  ( ph  ->  { <. <. x ,  y
>. ,  z >.  |  ps }  =  { <. <. x ,  y
>. ,  z >.  |  ch } )
Distinct variable groups:    x, z    y,
z
Allowed substitution hints:    ph( x, y, z)    ps( x, y, z)    ch( x, y, z)

Proof of Theorem oprabbid
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 oprabbid.1 . . . 4  |-  F/ x ph
2 oprabbid.2 . . . . 5  |-  F/ y
ph
3 oprabbid.3 . . . . . 6  |-  F/ z
ph
4 oprabbid.4 . . . . . . 7  |-  ( ph  ->  ( ps  <->  ch )
)
54anbi2d 445 . . . . . 6  |-  ( ph  ->  ( ( w  = 
<. <. x ,  y
>. ,  z >.  /\ 
ps )  <->  ( w  =  <. <. x ,  y
>. ,  z >.  /\ 
ch ) ) )
63, 5exbid 1523 . . . . 5  |-  ( ph  ->  ( E. z ( w  =  <. <. x ,  y >. ,  z
>.  /\  ps )  <->  E. z
( w  =  <. <.
x ,  y >. ,  z >.  /\  ch ) ) )
72, 6exbid 1523 . . . 4  |-  ( ph  ->  ( E. y E. z ( w  = 
<. <. x ,  y
>. ,  z >.  /\ 
ps )  <->  E. y E. z ( w  = 
<. <. x ,  y
>. ,  z >.  /\ 
ch ) ) )
81, 7exbid 1523 . . 3  |-  ( ph  ->  ( E. x E. y E. z ( w  =  <. <. x ,  y
>. ,  z >.  /\ 
ps )  <->  E. x E. y E. z ( w  =  <. <. x ,  y >. ,  z
>.  /\  ch ) ) )
98abbidv 2171 . 2  |-  ( ph  ->  { w  |  E. x E. y E. z
( w  =  <. <.
x ,  y >. ,  z >.  /\  ps ) }  =  {
w  |  E. x E. y E. z ( w  =  <. <. x ,  y >. ,  z
>.  /\  ch ) } )
10 df-oprab 5544 . 2  |-  { <. <.
x ,  y >. ,  z >.  |  ps }  =  { w  |  E. x E. y E. z ( w  = 
<. <. x ,  y
>. ,  z >.  /\ 
ps ) }
11 df-oprab 5544 . 2  |-  { <. <.
x ,  y >. ,  z >.  |  ch }  =  { w  |  E. x E. y E. z ( w  = 
<. <. x ,  y
>. ,  z >.  /\ 
ch ) }
129, 10, 113eqtr4g 2113 1  |-  ( ph  ->  { <. <. x ,  y
>. ,  z >.  |  ps }  =  { <. <. x ,  y
>. ,  z >.  |  ch } )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 101    <-> wb 102    = wceq 1259   F/wnf 1365   E.wex 1397   {cab 2042   <.cop 3406   {coprab 5541
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-11 1413  ax-4 1416  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038
This theorem depends on definitions:  df-bi 114  df-tru 1262  df-nf 1366  df-sb 1662  df-clab 2043  df-cleq 2049  df-oprab 5544
This theorem is referenced by:  oprabbidv  5587  mpt2eq123  5592
  Copyright terms: Public domain W3C validator