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

Theorem unielxp 5800
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 5797 . 2  |-  ( A  e.  ( B  X.  C )  <->  ( A  e.  ( _V  X.  _V )  /\  ( ( 1st `  A )  e.  B  /\  ( 2nd `  A
)  e.  C ) ) )
2 elvvuni 4404 . . . 4  |-  ( A  e.  ( _V  X.  _V )  ->  U. A  e.  A )
32adantr 261 . . 3  |-  ( ( A  e.  ( _V 
X.  _V )  /\  (
( 1st `  A
)  e.  B  /\  ( 2nd `  A )  e.  C ) )  ->  U. A  e.  A
)
4 simprl 483 . . . . . 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 2101 . . . . . . . 8  |-  ( x  =  A  ->  ( U. A  e.  x  <->  U. A  e.  A ) )
6 eleq1 2100 . . . . . . . . 9  |-  ( x  =  A  ->  (
x  e.  ( _V 
X.  _V )  <->  A  e.  ( _V  X.  _V )
) )
7 fveq2 5178 . . . . . . . . . . 11  |-  ( x  =  A  ->  ( 1st `  x )  =  ( 1st `  A
) )
87eleq1d 2106 . . . . . . . . . 10  |-  ( x  =  A  ->  (
( 1st `  x
)  e.  B  <->  ( 1st `  A )  e.  B
) )
9 fveq2 5178 . . . . . . . . . . 11  |-  ( x  =  A  ->  ( 2nd `  x )  =  ( 2nd `  A
) )
109eleq1d 2106 . . . . . . . . . 10  |-  ( x  =  A  ->  (
( 2nd `  x
)  e.  C  <->  ( 2nd `  A )  e.  C
) )
118, 10anbi12d 442 . . . . . . . . 9  |-  ( x  =  A  ->  (
( ( 1st `  x
)  e.  B  /\  ( 2nd `  x )  e.  C )  <->  ( ( 1st `  A )  e.  B  /\  ( 2nd `  A )  e.  C
) ) )
126, 11anbi12d 442 . . . . . . . 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 442 . . . . . . 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 2641 . . . . . 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 32 . . . . 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 3592 . . . . 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 137 . . . 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 5799 . . . . . 6  |-  ( B  X.  C )  =  { x  e.  ( _V  X.  _V )  |  ( ( 1st `  x )  e.  B  /\  ( 2nd `  x
)  e.  C ) }
19 df-rab 2315 . . . . . 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 2060 . . . . 5  |-  ( B  X.  C )  =  { x  |  ( x  e.  ( _V 
X.  _V )  /\  (
( 1st `  x
)  e.  B  /\  ( 2nd `  x )  e.  C ) ) }
2120unieqi 3590 . . . 4  |-  U. ( B  X.  C )  = 
U. { x  |  ( x  e.  ( _V  X.  _V )  /\  ( ( 1st `  x
)  e.  B  /\  ( 2nd `  x )  e.  C ) ) }
2217, 21syl6eleqr 2131 . . 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 399 . 2  |-  ( ( A  e.  ( _V 
X.  _V )  /\  (
( 1st `  A
)  e.  B  /\  ( 2nd `  A )  e.  C ) )  ->  U. A  e.  U. ( B  X.  C
) )
241, 23sylbi 114 1  |-  ( A  e.  ( B  X.  C )  ->  U. A  e.  U. ( B  X.  C ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 97    = wceq 1243   E.wex 1381    e. wcel 1393   {cab 2026   {crab 2310   _Vcvv 2557   U.cuni 3580    X. cxp 4343   ` cfv 4902   1stc1st 5765   2ndc2nd 5766
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-13 1404  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875  ax-pow 3927  ax-pr 3944  ax-un 4170
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-rab 2315  df-v 2559  df-sbc 2765  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-br 3765  df-opab 3819  df-mpt 3820  df-id 4030  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-iota 4867  df-fun 4904  df-fn 4905  df-f 4906  df-fo 4908  df-fv 4910  df-1st 5767  df-2nd 5768
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator