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

Theorem oprabbidv 5907
Description: Equivalent wff's yield equal operation class abstractions (deduction form). (Contributed by NM, 21-Feb-2004.)
Hypothesis
Ref Expression
oprabbidv.1  |-  ( ph  ->  ( ps  <->  ch )
)
Assertion
Ref Expression
oprabbidv  |-  ( ph  ->  { <. <. x ,  y
>. ,  z >.  |  ps }  =  { <. <. x ,  y
>. ,  z >.  |  ch } )
Distinct variable groups:    x, z, ph    y, z, ph
Allowed substitution hints:    ps( x, y, z)    ch( x, y, z)

Proof of Theorem oprabbidv
StepHypRef Expression
1 nfv 1521 . 2  |-  F/ x ph
2 nfv 1521 . 2  |-  F/ y
ph
3 nfv 1521 . 2  |-  F/ z
ph
4 oprabbidv.1 . 2  |-  ( ph  ->  ( ps  <->  ch )
)
51, 2, 3, 4oprabbid 5906 1  |-  ( ph  ->  { <. <. x ,  y
>. ,  z >.  |  ps }  =  { <. <. x ,  y
>. ,  z >.  |  ch } )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 104    = wceq 1348   {coprab 5854
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-11 1499  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152
This theorem depends on definitions:  df-bi 116  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-oprab 5857
This theorem is referenced by:  oprabbii  5908  mpoeq123dva  5914  mpoeq3dva  5917  resoprab2  5950  erovlem  6605
  Copyright terms: Public domain W3C validator