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

Theorem rabeqbidv 2655
Description: Equality of restricted class abstractions. (Contributed by Jeff Madsen, 1-Dec-2009.)
Hypotheses
Ref Expression
rabeqbidv.1  |-  ( ph  ->  A  =  B )
rabeqbidv.2  |-  ( ph  ->  ( ps  <->  ch )
)
Assertion
Ref Expression
rabeqbidv  |-  ( ph  ->  { x  e.  A  |  ps }  =  {
x  e.  B  |  ch } )
Distinct variable groups:    x, A    x, B    ph, x
Allowed substitution hints:    ps( x)    ch( x)

Proof of Theorem rabeqbidv
StepHypRef Expression
1 rabeqbidv.1 . . 3  |-  ( ph  ->  A  =  B )
2 rabeq 2652 . . 3  |-  ( A  =  B  ->  { x  e.  A  |  ps }  =  { x  e.  B  |  ps } )
31, 2syl 14 . 2  |-  ( ph  ->  { x  e.  A  |  ps }  =  {
x  e.  B  |  ps } )
4 rabeqbidv.2 . . 3  |-  ( ph  ->  ( ps  <->  ch )
)
54rabbidv 2649 . 2  |-  ( ph  ->  { x  e.  B  |  ps }  =  {
x  e.  B  |  ch } )
63, 5eqtrd 2150 1  |-  ( ph  ->  { x  e.  A  |  ps }  =  {
x  e.  B  |  ch } )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 104    = wceq 1316   {crab 2397
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-io 683  ax-5 1408  ax-7 1409  ax-gen 1410  ax-ie1 1454  ax-ie2 1455  ax-8 1467  ax-10 1468  ax-11 1469  ax-i12 1470  ax-bndl 1471  ax-4 1472  ax-17 1491  ax-i9 1495  ax-ial 1499  ax-i5r 1500  ax-ext 2099
This theorem depends on definitions:  df-bi 116  df-tru 1319  df-nf 1422  df-sb 1721  df-clab 2104  df-cleq 2110  df-clel 2113  df-nfc 2247  df-ral 2398  df-rab 2402
This theorem is referenced by:  elfvmptrab1  5483  mpoxopoveq  6105  supeq123d  6846  phival  11816  dfphi2  11823  cldval  12195  neifval  12236  cnfval  12290  cnpfval  12291  cnprcl2k  12302  hmeofvalg  12399  ispsmet  12419  ismet  12440  isxmet  12441  blfvalps  12481  cncfval  12655
  Copyright terms: Public domain W3C validator