Theorem iinxprg 3940

Description: Indexed intersection with an unordered pair index. (Contributed by NM, 25-Jan-2012.)

Hypotheses

Ref	Expression
iinxprg.1	|- ( x = A -> C = D )
iinxprg.2	|- ( x = B -> C = E )

Assertion

Ref	Expression
iinxprg	|- ( ( A e. V /\ B e. W ) -> |^|_ x e. { A , B } C = ( D i^i E ) )

Distinct variable groups:   x, A   x, B   x, D   x, E

Allowed substitution hints:   C( x)   V( x)   W( x)

Proof of Theorem iinxprg

Dummy variable y is distinct from all other variables.

Step	Hyp	Ref	Expression
1		iinxprg.1	. . . . 5 |- ( x = A -> C = D )
2	1	eleq2d 2236	. . . 4 |- ( x = A -> ( y e. C <-> y e. D ) )
3		iinxprg.2	. . . . 5 |- ( x = B -> C = E )
4	3	eleq2d 2236	. . . 4 |- ( x = B -> ( y e. C <-> y e. E ) )
5	2, 4	ralprg 3627	. . 3 |- ( ( A e. V /\ B e. W ) -> ( A. x e. { A , B } y e. C <-> ( y e. D /\ y e. E ) ) )
6	5	abbidv 2284	. 2 |- ( ( A e. V /\ B e. W ) -> { y | A. x e. { A , B } y e. C } = { y | ( y e. D /\ y e. E ) } )
7		df-iin 3869	. 2 |- |^|_ x e. { A , B } C = { y | A. x e. { A , B } y e. C }
8		df-in 3122	. 2 |- ( D i^i E ) = { y | ( y e. D /\ y e. E ) }
9	6, 7, 8	3eqtr4g 2224	1 |- ( ( A e. V /\ B e. W ) -> |^|_ x e. { A , B } C = ( D i^i E ) )

Syntax hints:   -> wi 4   /\ wa 103   = wceq 1343   e. wcel 2136   {cab 2151   A.wral 2444   i^i cin 3115   {cpr 3577   |^|_ciin 3867

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-ext 2147

This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-v 2728  df-sbc 2952  df-un 3120  df-in 3122  df-sn 3582  df-pr 3583  df-iin 3869

This theorem is referenced by: (None)