Theorem ssiinf 4014

Description: Subset theorem for an indexed intersection. (Contributed by FL, 15-Oct-2012.) (Proof shortened by Mario Carneiro, 14-Oct-2016.)

Hypothesis

Ref	Expression
ssiinf.1	|- F/_ x C

Assertion

Ref	Expression
ssiinf	|- ( C C_ |^|_ x e. A B <-> A. x e. A C C_ B )

Proof of Theorem ssiinf

Dummy variable y is distinct from all other variables.

Step	Hyp	Ref	Expression
1		vex 2802	. . . . 5 |- y e. _V
2		eliin 3969	. . . . 5 |- ( y e. _V -> ( y e. |^|_ x e. A B <-> A. x e. A y e. B ) )
3	1, 2	ax-mp 5	. . . 4 |- ( y e. |^|_ x e. A B <-> A. x e. A y e. B )
4	3	ralbii 2536	. . 3 |- ( A. y e. C y e. |^|_ x e. A B <-> A. y e. C A. x e. A y e. B )
5		ssiinf.1	. . . 4 |- F/_ x C
6		nfcv 2372	. . . 4 |- F/_ y A
7	5, 6	ralcomf 2692	. . 3 |- ( A. y e. C A. x e. A y e. B <-> A. x e. A A. y e. C y e. B )
8	4, 7	bitri 184	. 2 |- ( A. y e. C y e. |^|_ x e. A B <-> A. x e. A A. y e. C y e. B )
9		dfss3 3213	. 2 |- ( C C_ |^|_ x e. A B <-> A. y e. C y e. |^|_ x e. A B )
10		dfss3 3213	. . 3 |- ( C C_ B <-> A. y e. C y e. B )
11	10	ralbii 2536	. 2 |- ( A. x e. A C C_ B <-> A. x e. A A. y e. C y e. B )
12	8, 9, 11	3bitr4i 212	1 |- ( C C_ |^|_ x e. A B <-> A. x e. A C C_ B )

Syntax hints:   <-> wb 105   e. wcel 2200   F/_wnfc 2359   A.wral 2508   _Vcvv 2799   C_ wss 3197   |^|_ciin 3965

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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211

This theorem depends on definitions:  df-bi 117  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-v 2801  df-in 3203  df-ss 3210  df-iin 3967

This theorem is referenced by:  ssiin  4015  dmiin  4969