Theorem cbvab 2301

Description: Rule used to change bound variables, using implicit substitution. (Contributed by Andrew Salmon, 11-Jul-2011.)

Hypotheses

Ref	Expression
cbvab.1	|- F/ y ph
cbvab.2	|- F/ x ps
cbvab.3	|- ( x = y -> ( ph <-> ps ) )

Assertion

Ref	Expression
cbvab	|- { x | ph } = { y | ps }

Proof of Theorem cbvab

Dummy variable z is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cbvab.2	. . . . 5 |- F/ x ps
2	1	nfsb 1946	. . . 4 |- F/ x [ z / y ] ps
3		cbvab.1	. . . . . 6 |- F/ y ph
4		cbvab.3	. . . . . . . 8 |- ( x = y -> ( ph <-> ps ) )
5	4	equcoms 1708	. . . . . . 7 |- ( y = x -> ( ph <-> ps ) )
6	5	bicomd 141	. . . . . 6 |- ( y = x -> ( ps <-> ph ) )
7	3, 6	sbie 1791	. . . . 5 |- ( [ x / y ] ps <-> ph )
8		sbequ 1840	. . . . 5 |- ( x = z -> ( [ x / y ] ps <-> [ z / y ] ps ) )
9	7, 8	bitr3id 194	. . . 4 |- ( x = z -> ( ph <-> [ z / y ] ps ) )
10	2, 9	sbie 1791	. . 3 |- ( [ z / x ] ph <-> [ z / y ] ps )
11		df-clab 2164	. . 3 |- ( z e. { x | ph } <-> [ z / x ] ph )
12		df-clab 2164	. . 3 |- ( z e. { y | ps } <-> [ z / y ] ps )
13	10, 11, 12	3bitr4i 212	. 2 |- ( z e. { x | ph } <-> z e. { y | ps } )
14	13	eqriv 2174	1 |- { x | ph } = { y | ps }

Syntax hints:   -> wi 4   <-> wb 105   = wceq 1353   F/wnf 1460   [wsb 1762   e. wcel 2148   {cab 2163

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-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159

This theorem depends on definitions:  df-bi 117  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170

This theorem is referenced by:  cbvabv  2302  cbvrab  2735  cbvsbc  2991  cbvrabcsf  3122  dfdmf  4818  dfrnf  4866  funfvdm2f  5579  abrexex2g  6117  abrexex2  6121