Theorem rabeqf 2550

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

Step	Hyp	Ref	Expression
1		rabeqf.1	. . . 4 |- F/_ x A
2		rabeqf.2	. . . 4 |- F/_ x B
3	1, 2	nfeq 2185	. . 3 |- F/ x A = B
4		eleq2 2101	. . . 4 |- ( A = B -> ( x e. A <-> x e. B ) )
5	4	anbi1d 438	. . 3 |- ( A = B -> ( ( x e. A /\ ph ) <-> ( x e. B /\ ph ) ) )
6	3, 5	abbid 2154	. 2 |- ( A = B -> { x | ( x e. A /\ ph ) } = { x | ( x e. B /\ ph ) } )
7		df-rab 2315	. 2 |- { x e. A | ph } = { x | ( x e. A /\ ph ) }
8		df-rab 2315	. 2 |- { x e. B | ph } = { x | ( x e. B /\ ph ) }
9	6, 7, 8	3eqtr4g 2097	1 |- ( A = B -> { x e. A | ph } = { x e. B | ph } )

Syntax hints:   -> wi 4   /\ wa 97   = wceq 1243   e. wcel 1393   {cab 2026   F/_wnfc 2165   {crab 2310

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022

This theorem depends on definitions:  df-bi 110  df-tru 1246  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-rab 2315

This theorem is referenced by:  rabeq  2551