Theorem rabbi 2611

Description: Equivalent wff's correspond to equal restricted class abstractions. Closed theorem form of rabbidva 2677. (Contributed by NM, 25-Nov-2013.)

Assertion

Ref	Expression
rabbi	|- ( A. x e. A ( ps <-> ch ) <-> { x e. A | ps } = { x e. A | ch } )

Proof of Theorem rabbi

Step	Hyp	Ref	Expression
1		abbi 2254	. 2 |- ( A. x ( ( x e. A /\ ps ) <-> ( x e. A /\ ch ) ) <-> { x | ( x e. A /\ ps ) } = { x | ( x e. A /\ ch ) } )
2		df-ral 2422	. . 3 |- ( A. x e. A ( ps <-> ch ) <-> A. x ( x e. A -> ( ps <-> ch ) ) )
3		pm5.32 449	. . . 4 |- ( ( x e. A -> ( ps <-> ch ) ) <-> ( ( x e. A /\ ps ) <-> ( x e. A /\ ch ) ) )
4	3	albii 1447	. . 3 |- ( A. x ( x e. A -> ( ps <-> ch ) ) <-> A. x ( ( x e. A /\ ps ) <-> ( x e. A /\ ch ) ) )
5	2, 4	bitri 183	. 2 |- ( A. x e. A ( ps <-> ch ) <-> A. x ( ( x e. A /\ ps ) <-> ( x e. A /\ ch ) ) )
6		df-rab 2426	. . 3 |- { x e. A | ps } = { x | ( x e. A /\ ps ) }
7		df-rab 2426	. . 3 |- { x e. A | ch } = { x | ( x e. A /\ ch ) }
8	6, 7	eqeq12i 2154	. 2 |- ( { x e. A | ps } = { x e. A | ch } <-> { x | ( x e. A /\ ps ) } = { x | ( x e. A /\ ch ) } )
9	1, 5, 8	3bitr4i 211	1 |- ( A. x e. A ( ps <-> ch ) <-> { x e. A | ps } = { x e. A | ch } )

Syntax hints:   -> wi 4   /\ wa 103   <-> wb 104   A.wal 1330   = wceq 1332   e. wcel 1481   {cab 2126   A.wral 2417   {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-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-11 1485  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-ral 2422  df-rab 2426

This theorem is referenced by:  rabbidva  2677  exmidonfinlem  7066