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

Theorem opabbidv 4197
Description: Equivalent wff's yield equal ordered-pair class abstractions (deduction form). (Contributed by NM, 15-May-1995.)
Hypothesis
Ref Expression
opabbidv.1  |-  ( ph  ->  ( ps  <->  ch )
)
Assertion
Ref Expression
opabbidv  |-  ( ph  ->  { <. x ,  y
>.  |  ps }  =  { <. x ,  y
>.  |  ch } )
Distinct variable groups:    ph, x    ph, y
Allowed substitution hints:    ps( x,  y)    ch( x,  y)

Proof of Theorem opabbidv
StepHypRef Expression
1 nfv 1581 . 2  |-  F/ x ph
2 nfv 1581 . 2  |-  F/ y
ph
3 opabbidv.1 . 2  |-  ( ph  ->  ( ps  <->  ch )
)
41, 2, 3opabbid 4196 1  |-  ( ph  ->  { <. x ,  y
>.  |  ps }  =  { <. x ,  y
>.  |  ch } )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    <-> wb 105    = wceq 1402   {copab 4191
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-11 1559  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This proof depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-opab 4193
This theorem is used by:  opabbii  4198  csbopabg  4209  xpeq1  4788  xpeq2  4789  opabbi2dv  4929  csbcnvg  4964  resopab2  5110  mptcnv  5190  cores  5291  xpcom  5334  dffn5im  5748  f1oiso2  6033  f1ocnvd  6292  f1o3d  6298  ofreq  6306  f1od2  6471  shftfvalg  11583  shftfval  11586  2shfti  11596  releqgg  14023  eqgex  14024  eqgfval  14025  prdsex  14172  prdsval  14173  dvdsrvald  14400  dvdsrpropdg  14454  aprval  14591  aprap  14598  aprprop  14601  lmfval  15294  lgsquadlem3  16198  wksfval  16563  trlsfvalg  16624  eupthsg  16686
  Copyright terms: Public domain W3C validator