Theorem iinxprg 4066

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 2302	. . . 4 |- ( x = A -> ( y e. C <-> y e. D ) )
3		iinxprg.2	. . . . 5 |- ( x = B -> C = E )
4	3	eleq2d 2302	. . . 4 |- ( x = B -> ( y e. C <-> y e. E ) )
5	2, 4	ralprg 3740	. . 3 |- ( ( A e. V /\ B e. W ) -> ( A. x e. { A , B } y e. C <-> ( y e. D /\ y e. E ) ) )
6	5	abbidv 2352	. 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 3994	. 2 |- |^|_ x e. { A , B } C = { y | A. x e. { A , B } y e. C }
8		df-in 3217	. 2 |- ( D i^i E ) = { y | ( y e. D /\ y e. E ) }
9	6, 7, 8	3eqtr4g 2290	1 |- ( ( A e. V /\ B e. W ) -> |^|_ x e. { A , B } C = ( D i^i E ) )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1398   e. wcel 2203   {cab 2218   A.wral 2520   i^i cin 3210   {cpr 3690   |^|_ciin 3992

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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2214

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-v 2815  df-sbc 3043  df-un 3215  df-in 3217  df-sn 3695  df-pr 3696  df-iin 3994

This theorem is referenced by: (None)