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

Theorem rabeqf 2679
Description: Equality theorem for restricted class abstractions, with bound-variable hypotheses instead of distinct variable restrictions. (Contributed by NM, 7-Mar-2004.)
Hypotheses
Ref Expression
rabeqf.1  |-  F/_ x A
rabeqf.2  |-  F/_ x B
Assertion
Ref Expression
rabeqf  |-  ( A  =  B  ->  { x  e.  A  |  ph }  =  { x  e.  B  |  ph } )

Proof of Theorem rabeqf
StepHypRef Expression
1 rabeqf.1 . . . 4  |-  F/_ x A
2 rabeqf.2 . . . 4  |-  F/_ x B
31, 2nfeq 2290 . . 3  |-  F/ x  A  =  B
4 eleq2 2204 . . . 4  |-  ( A  =  B  ->  (
x  e.  A  <->  x  e.  B ) )
54anbi1d 461 . . 3  |-  ( A  =  B  ->  (
( x  e.  A  /\  ph )  <->  ( x  e.  B  /\  ph )
) )
63, 5abbid 2257 . 2  |-  ( A  =  B  ->  { x  |  ( x  e.  A  /\  ph ) }  =  { x  |  ( x  e.  B  /\  ph ) } )
7 df-rab 2426 . 2  |-  { x  e.  A  |  ph }  =  { x  |  ( x  e.  A  /\  ph ) }
8 df-rab 2426 . 2  |-  { x  e.  B  |  ph }  =  { x  |  ( x  e.  B  /\  ph ) }
96, 7, 83eqtr4g 2198 1  |-  ( A  =  B  ->  { x  e.  A  |  ph }  =  { x  e.  B  |  ph } )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    = wceq 1332    e. wcel 1481   {cab 2126   F/_wnfc 2269   {crab 2421
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 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122
This theorem depends on definitions:  df-bi 116  df-tru 1335  df-nf 1438  df-sb 1737  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-rab 2426
This theorem is referenced by:  rabeqif  2680  rabeq  2681
  Copyright terms: Public domain W3C validator