Theorem abidnf 2948

Description: Identity used to create closed-form versions of bound-variable hypothesis builders for class expressions. (Contributed by NM, 10-Nov-2005.) (Proof shortened by Mario Carneiro, 12-Oct-2016.)

Assertion

Ref	Expression
abidnf	|- ( F/_ x A -> { z | A. x z e. A } = A )

Distinct variable groups:   x, z   z, A

Allowed substitution hint:   A( x)

Proof of Theorem abidnf

Step	Hyp	Ref	Expression
1		sp 1535	. . 3 |- ( A. x z e. A -> z e. A )
2		nfcr 2342	. . . 4 |- ( F/_ x A -> F/ x z e. A )
3	2	nfrd 1544	. . 3 |- ( F/_ x A -> ( z e. A -> A. x z e. A ) )
4	1, 3	impbid2 143	. 2 |- ( F/_ x A -> ( A. x z e. A <-> z e. A ) )
5	4	abbi1dv 2327	1 |- ( F/_ x A -> { z | A. x z e. A } = A )

Syntax hints:   -> wi 4   A.wal 1371   = wceq 1373   e. wcel 2178   {cab 2193   F/_wnfc 2337

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 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-11 1530  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2189

This theorem depends on definitions:  df-bi 117  df-nf 1485  df-sb 1787  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339

This theorem is referenced by:  dedhb  2949  nfopd  3850  nfimad  5050  nffvd  5611