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

Theorem unielxp 6318
Description: The membership relation for a cross product is inherited by union. (Contributed by NM, 16-Sep-2006.)
Assertion
Ref Expression
unielxp  |-  ( A  e.  ( B  X.  C )  ->  U. A  e.  U. ( B  X.  C ) )

Proof of Theorem unielxp
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 elxp7 6314 . 2  |-  ( A  e.  ( B  X.  C )  <->  ( A  e.  ( _V  X.  _V )  /\  ( ( 1st `  A )  e.  B  /\  ( 2nd `  A
)  e.  C ) ) )
2 elvvuni 4782 . . . 4  |-  ( A  e.  ( _V  X.  _V )  ->  U. A  e.  A )
32adantr 276 . . 3  |-  ( ( A  e.  ( _V 
X.  _V )  /\  (
( 1st `  A
)  e.  B  /\  ( 2nd `  A )  e.  C ) )  ->  U. A  e.  A
)
4 simprl 529 . . . . . 6  |-  ( ( U. A  e.  A  /\  ( A  e.  ( _V  X.  _V )  /\  ( ( 1st `  A
)  e.  B  /\  ( 2nd `  A )  e.  C ) ) )  ->  A  e.  ( _V  X.  _V )
)
5 eleq2 2293 . . . . . . . 8  |-  ( x  =  A  ->  ( U. A  e.  x  <->  U. A  e.  A ) )
6 eleq1 2292 . . . . . . . . 9  |-  ( x  =  A  ->  (
x  e.  ( _V 
X.  _V )  <->  A  e.  ( _V  X.  _V )
) )
7 fveq2 5626 . . . . . . . . . . 11  |-  ( x  =  A  ->  ( 1st `  x )  =  ( 1st `  A
) )
87eleq1d 2298 . . . . . . . . . 10  |-  ( x  =  A  ->  (
( 1st `  x
)  e.  B  <->  ( 1st `  A )  e.  B
) )
9 fveq2 5626 . . . . . . . . . . 11  |-  ( x  =  A  ->  ( 2nd `  x )  =  ( 2nd `  A
) )
109eleq1d 2298 . . . . . . . . . 10  |-  ( x  =  A  ->  (
( 2nd `  x
)  e.  C  <->  ( 2nd `  A )  e.  C
) )
118, 10anbi12d 473 . . . . . . . . 9  |-  ( x  =  A  ->  (
( ( 1st `  x
)  e.  B  /\  ( 2nd `  x )  e.  C )  <->  ( ( 1st `  A )  e.  B  /\  ( 2nd `  A )  e.  C
) ) )
126, 11anbi12d 473 . . . . . . . 8  |-  ( x  =  A  ->  (
( x  e.  ( _V  X.  _V )  /\  ( ( 1st `  x
)  e.  B  /\  ( 2nd `  x )  e.  C ) )  <-> 
( A  e.  ( _V  X.  _V )  /\  ( ( 1st `  A
)  e.  B  /\  ( 2nd `  A )  e.  C ) ) ) )
135, 12anbi12d 473 . . . . . . 7  |-  ( x  =  A  ->  (
( U. A  e.  x  /\  ( x  e.  ( _V  X.  _V )  /\  (
( 1st `  x
)  e.  B  /\  ( 2nd `  x )  e.  C ) ) )  <->  ( U. A  e.  A  /\  ( A  e.  ( _V  X.  _V )  /\  (
( 1st `  A
)  e.  B  /\  ( 2nd `  A )  e.  C ) ) ) ) )
1413spcegv 2891 . . . . . 6  |-  ( A  e.  ( _V  X.  _V )  ->  ( ( U. A  e.  A  /\  ( A  e.  ( _V  X.  _V )  /\  ( ( 1st `  A
)  e.  B  /\  ( 2nd `  A )  e.  C ) ) )  ->  E. x
( U. A  e.  x  /\  ( x  e.  ( _V  X.  _V )  /\  (
( 1st `  x
)  e.  B  /\  ( 2nd `  x )  e.  C ) ) ) ) )
154, 14mpcom 36 . . . . 5  |-  ( ( U. A  e.  A  /\  ( A  e.  ( _V  X.  _V )  /\  ( ( 1st `  A
)  e.  B  /\  ( 2nd `  A )  e.  C ) ) )  ->  E. x
( U. A  e.  x  /\  ( x  e.  ( _V  X.  _V )  /\  (
( 1st `  x
)  e.  B  /\  ( 2nd `  x )  e.  C ) ) ) )
16 eluniab 3899 . . . . 5  |-  ( U. A  e.  U. { x  |  ( x  e.  ( _V  X.  _V )  /\  ( ( 1st `  x )  e.  B  /\  ( 2nd `  x
)  e.  C ) ) }  <->  E. x
( U. A  e.  x  /\  ( x  e.  ( _V  X.  _V )  /\  (
( 1st `  x
)  e.  B  /\  ( 2nd `  x )  e.  C ) ) ) )
1715, 16sylibr 134 . . . 4  |-  ( ( U. A  e.  A  /\  ( A  e.  ( _V  X.  _V )  /\  ( ( 1st `  A
)  e.  B  /\  ( 2nd `  A )  e.  C ) ) )  ->  U. A  e. 
U. { x  |  ( x  e.  ( _V  X.  _V )  /\  ( ( 1st `  x
)  e.  B  /\  ( 2nd `  x )  e.  C ) ) } )
18 xp2 6317 . . . . . 6  |-  ( B  X.  C )  =  { x  e.  ( _V  X.  _V )  |  ( ( 1st `  x )  e.  B  /\  ( 2nd `  x
)  e.  C ) }
19 df-rab 2517 . . . . . 6  |-  { x  e.  ( _V  X.  _V )  |  ( ( 1st `  x )  e.  B  /\  ( 2nd `  x )  e.  C
) }  =  {
x  |  ( x  e.  ( _V  X.  _V )  /\  (
( 1st `  x
)  e.  B  /\  ( 2nd `  x )  e.  C ) ) }
2018, 19eqtri 2250 . . . . 5  |-  ( B  X.  C )  =  { x  |  ( x  e.  ( _V 
X.  _V )  /\  (
( 1st `  x
)  e.  B  /\  ( 2nd `  x )  e.  C ) ) }
2120unieqi 3897 . . . 4  |-  U. ( B  X.  C )  = 
U. { x  |  ( x  e.  ( _V  X.  _V )  /\  ( ( 1st `  x
)  e.  B  /\  ( 2nd `  x )  e.  C ) ) }
2217, 21eleqtrrdi 2323 . . 3  |-  ( ( U. A  e.  A  /\  ( A  e.  ( _V  X.  _V )  /\  ( ( 1st `  A
)  e.  B  /\  ( 2nd `  A )  e.  C ) ) )  ->  U. A  e. 
U. ( B  X.  C ) )
233, 22mpancom 422 . 2  |-  ( ( A  e.  ( _V 
X.  _V )  /\  (
( 1st `  A
)  e.  B  /\  ( 2nd `  A )  e.  C ) )  ->  U. A  e.  U. ( B  X.  C
) )
241, 23sylbi 121 1  |-  ( A  e.  ( B  X.  C )  ->  U. A  e.  U. ( B  X.  C ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1395   E.wex 1538    e. wcel 2200   {cab 2215   {crab 2512   _Vcvv 2799   U.cuni 3887    X. cxp 4716   ` cfv 5317   1stc1st 6282   2ndc2nd 6283
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-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4201  ax-pow 4257  ax-pr 4292  ax-un 4523
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2801  df-sbc 3029  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-br 4083  df-opab 4145  df-mpt 4146  df-id 4383  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-fo 5323  df-fv 5325  df-1st 6284  df-2nd 6285
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator