Theorem eqabcdv 2470

Description: Deduction from a wff to a class abstraction. (Contributed by NM, 9-Jul-1994.)

Hypothesis

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

Assertion

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

Distinct variable groups:   x,A   ph,x

Allowed substitution hint:   ps(x)

Proof of Theorem eqabcdv

Step	Hyp	Ref	Expression
1		eqabcdv.1	. . 3 |- (ph -> (ps <-> x e. A))
2	1	alrimiv 1631	. 2 |- (ph -> A.x(ps <-> x e. A))
3		eqabcb 2460	. 2 |- ({x | ps} = A <-> A.x(ps <-> x e. A))
4	2, 3	sylibr 203	1 |- (ph -> {x | ps} = A)

Syntax hints:   -> wi 4   <-> wb 176  A.wal 1540   = wceq 1642   e. wcel 1710  {cab 2339

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334

This theorem depends on definitions:  df-bi 177  df-an 360  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349

This theorem is referenced by:  abidnf  3006  csbtt  3149  csbvarg  3164  csbie2g  3183  abvor0  3568  iinxsng  4043  enpw1  6063