Theorem sbcel12g 3162

Description: Distribute proper substitution through a membership relation. (Contributed by NM, 10-Nov-2005.) (Proof shortened by Andrew Salmon, 29-Jun-2011.)

Assertion

Ref	Expression
sbcel12g	|- ( A e. V -> ( [. A / x ]. B e. C <-> [_ A / x ]_ B e. [_ A / x ]_ C ) )

Proof of Theorem sbcel12g

Dummy variables y z are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		dfsbcq2 3054	. . 3 |- ( z = A -> ( [ z / x ] B e. C <-> [. A / x ]. B e. C ) )
2		dfsbcq2 3054	. . . . 5 |- ( z = A -> ( [ z / x ] y e. B <-> [. A / x ]. y e. B ) )
3	2	abbidv 2358	. . . 4 |- ( z = A -> { y | [ z / x ] y e. B } = { y | [. A / x ]. y e. B } )
4		dfsbcq2 3054	. . . . 5 |- ( z = A -> ( [ z / x ] y e. C <-> [. A / x ]. y e. C ) )
5	4	abbidv 2358	. . . 4 |- ( z = A -> { y | [ z / x ] y e. C } = { y | [. A / x ]. y e. C } )
6	3, 5	eleq12d 2309	. . 3 |- ( z = A -> ( { y | [ z / x ] y e. B } e. { y | [ z / x ] y e. C } <-> { y | [. A / x ]. y e. B } e. { y | [. A / x ]. y e. C } ) )
7		nfs1v 1999	. . . . . 6 |- F/ x [ z / x ] y e. B
8	7	nfab 2397	. . . . 5 |- F/_ x { y | [ z / x ] y e. B }
9		nfs1v 1999	. . . . . 6 |- F/ x [ z / x ] y e. C
10	9	nfab 2397	. . . . 5 |- F/_ x { y | [ z / x ] y e. C }
11	8, 10	nfel 2401	. . . 4 |- F/ x { y | [ z / x ] y e. B } e. { y | [ z / x ] y e. C }
12		sbab 2368	. . . . 5 |- ( x = z -> B = { y | [ z / x ] y e. B } )
13		sbab 2368	. . . . 5 |- ( x = z -> C = { y | [ z / x ] y e. C } )
14	12, 13	eleq12d 2309	. . . 4 |- ( x = z -> ( B e. C <-> { y | [ z / x ] y e. B } e. { y | [ z / x ] y e. C } ) )
15	11, 14	sbie 1844	. . 3 |- ( [ z / x ] B e. C <-> { y | [ z / x ] y e. B } e. { y | [ z / x ] y e. C } )
16	1, 6, 15	vtoclbg 2884	. 2 |- ( A e. V -> ( [. A / x ]. B e. C <-> { y | [. A / x ]. y e. B } e. { y | [. A / x ]. y e. C } ) )
17		df-csb 3148	. . 3 |- [_ A / x ]_ B = { y | [. A / x ]. y e. B }
18		df-csb 3148	. . 3 |- [_ A / x ]_ C = { y | [. A / x ]. y e. C }
19	17, 18	eleq12i 2306	. 2 |- ( [_ A / x ]_ B e. [_ A / x ]_ C <-> { y | [. A / x ]. y e. B } e. { y | [. A / x ]. y e. C } )
20	16, 19	bitr4di 198	1 |- ( A e. V -> ( [. A / x ]. B e. C <-> [_ A / x ]_ B e. [_ A / x ]_ C ) )

Syntax hints:   -> wi 4   <-> wb 105   = wceq 1402   [wsb 1815   e. wcel 2209   {cab 2224   [.wsbc 3051   [_csb 3147

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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220

This theorem depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-v 2823  df-sbc 3052  df-csb 3148

This theorem is referenced by:  sbcnel12g  3164  sbcel1g  3166  sbcel2g  3168  sbccsb2g  3177  ixpsnval  6973