ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  iinxprg Unicode version

Theorem iinxprg 3855
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.
StepHypRef Expression
1 iinxprg.1 . . . . 5  |-  ( x  =  A  ->  C  =  D )
21eleq2d 2185 . . . 4  |-  ( x  =  A  ->  (
y  e.  C  <->  y  e.  D ) )
3 iinxprg.2 . . . . 5  |-  ( x  =  B  ->  C  =  E )
43eleq2d 2185 . . . 4  |-  ( x  =  B  ->  (
y  e.  C  <->  y  e.  E ) )
52, 4ralprg 3542 . . 3  |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( A. x  e. 
{ A ,  B } y  e.  C  <->  ( y  e.  D  /\  y  e.  E )
) )
65abbidv 2233 . 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 3784 . 2  |-  |^|_ x  e.  { A ,  B } C  =  {
y  |  A. x  e.  { A ,  B } y  e.  C }
8 df-in 3045 . 2  |-  ( D  i^i  E )  =  { y  |  ( y  e.  D  /\  y  e.  E ) }
96, 7, 83eqtr4g 2173 1  |-  ( ( A  e.  V  /\  B  e.  W )  -> 
|^|_ x  e.  { A ,  B } C  =  ( D  i^i  E
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    = wceq 1314    e. wcel 1463   {cab 2101   A.wral 2391    i^i cin 3038   {cpr 3496   |^|_ciin 3782
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 681  ax-5 1406  ax-7 1407  ax-gen 1408  ax-ie1 1452  ax-ie2 1453  ax-8 1465  ax-10 1466  ax-11 1467  ax-i12 1468  ax-bndl 1469  ax-4 1470  ax-17 1489  ax-i9 1493  ax-ial 1497  ax-i5r 1498  ax-ext 2097
This theorem depends on definitions:  df-bi 116  df-3an 947  df-tru 1317  df-nf 1420  df-sb 1719  df-clab 2102  df-cleq 2108  df-clel 2111  df-nfc 2245  df-ral 2396  df-v 2660  df-sbc 2881  df-un 3043  df-in 3045  df-sn 3501  df-pr 3502  df-iin 3784
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator