Theorem biabldv 1185

Description: Deduction from a wff to a class abstraction.

Hypothesis

Ref	Expression
biabldv.1	|- (ph -> (ps <-> x e. A))

Assertion

Ref	Expression
biabldv	|- (ph -> {x | ps} = A)

Distinct variable group(s):   x,A   ph,x

Proof of Theorem biabldv

Step	Hyp	Ref	Expression
1		biabldv.1	. . 3 |- (ph -> (ps <-> x e. A))
2	1	19.21aiv 943	. 2 |- (ph -> A.x(ps <-> x e. A))
3		cleqabr 1175	. 2 |- ({x | ps} = A <-> A.x(ps <-> x e. A))
4	2, 3	sylibr 175	1 |- (ph -> {x | ps} = A)

Syntax hints:   -> wi 2   <-> wb 127  A.wal 672  {cab 1090   = wceq 1091   e. wcel 1092

This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-16 922  ax-17 925  ax-ext 1074

This theorem depends on definitions:  df-bi 128  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099

metamath.org