Theorem rabbia2 2787

Description: Equivalent wff's yield equal restricted class abstractions. (Contributed by Glauco Siliprandi, 26-Jun-2021.)

Hypothesis

Ref	Expression
rabbia2.1	|- ( ( x e. A /\ ps ) <-> ( x e. B /\ ch ) )

Assertion

Ref	Expression
rabbia2	|- { x e. A | ps } = { x e. B | ch }

Proof of Theorem rabbia2

Step	Hyp	Ref	Expression
1		rabbia2.1	. . . 4 |- ( ( x e. A /\ ps ) <-> ( x e. B /\ ch ) )
2	1	a1i 9	. . 3 |- ( T. -> ( ( x e. A /\ ps ) <-> ( x e. B /\ ch ) ) )
3	2	rabbidva2 2786	. 2 |- ( T. -> { x e. A | ps } = { x e. B | ch } )
4	3	mptru 1406	1 |- { x e. A | ps } = { x e. B | ch }

Syntax hints:   /\ wa 104   <-> wb 105   = wceq 1397   T. wtru 1398   e. wcel 2202   {crab 2514

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-11 1554  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213

This theorem depends on definitions:  df-bi 117  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-rab 2519

This theorem is referenced by:  sspw1or2  7402  clwwlknon2x  16285