Theorem abeqinbi 34018

Description: Intersection with class abstraction and equivalent wff's. (Contributed by Peter Mazsa, 21-Jul-2021.)

Hypotheses

Ref	Expression
abeqinbi.1	|- A = ( B i^i C )
abeqinbi.2	|- B = { x | ph }
abeqinbi.3	|- ( x e. C -> ( ph <-> ps ) )

Assertion

Ref	Expression
abeqinbi	|- A = { x e. C | ps }

Distinct variable group:   x, C

Allowed substitution hints:   ph( x)   ps( x)   A( x)   B( x)

Proof of Theorem abeqinbi

Step	Hyp	Ref	Expression
1		abeqinbi.1	. . 3 |- A = ( B i^i C )
2		abeqinbi.2	. . 3 |- B = { x | ph }
3	1, 2	abeqin 34017	. 2 |- A = { x e. C | ph }
4		abeqinbi.3	. 2 |- ( x e. C -> ( ph <-> ps ) )
5	3, 4	rabimbieq 34016	1 |- A = { x e. C | ps }

Syntax hints:   -> wi 4   <-> wb 196   = wceq 1483   e. wcel 1990   {cab 2608   {crab 2916   i^i cin 3573

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-rab 2921  df-v 3202  df-in 3581

This theorem is referenced by: (None)