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

Theorem uniqs 6867
Description: The union of a quotient set. (Contributed by NM, 9-Dec-2008.)
Assertion
Ref Expression
uniqs  |-  ( R  e.  V  ->  U. ( A /. R )  =  ( R " A
) )

Proof of Theorem uniqs
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ecexg 6811 . . . . 5  |-  ( R  e.  V  ->  [ x ] R  e.  _V )
21ralrimivw 2624 . . . 4  |-  ( R  e.  V  ->  A. x  e.  A  [ x ] R  e.  _V )
3 dfiun2g 4044 . . . 4  |-  ( A. x  e.  A  [
x ] R  e. 
_V  ->  U_ x  e.  A  [ x ] R  =  U. { y  |  E. x  e.  A  y  =  [ x ] R } )
42, 3syl 14 . . 3  |-  ( R  e.  V  ->  U_ x  e.  A  [ x ] R  =  U. { y  |  E. x  e.  A  y  =  [ x ] R } )
54eqcomd 2244 . 2  |-  ( R  e.  V  ->  U. {
y  |  E. x  e.  A  y  =  [ x ] R }  =  U_ x  e.  A  [ x ] R )
6 df-qs 6813 . . 3  |-  ( A /. R )  =  { y  |  E. x  e.  A  y  =  [ x ] R }
76unieqi 3945 . 2  |-  U. ( A /. R )  = 
U. { y  |  E. x  e.  A  y  =  [ x ] R }
8 df-ec 6809 . . . . 5  |-  [ x ] R  =  ( R " { x }
)
98a1i 9 . . . 4  |-  ( x  e.  A  ->  [ x ] R  =  ( R " { x }
) )
109iuneq2i 4030 . . 3  |-  U_ x  e.  A  [ x ] R  =  U_ x  e.  A  ( R " { x }
)
11 imaiun 5966 . . 3  |-  ( R
" U_ x  e.  A  { x } )  =  U_ x  e.  A  ( R " { x } )
12 iunid 4068 . . . 4  |-  U_ x  e.  A  { x }  =  A
1312imaeq2i 5124 . . 3  |-  ( R
" U_ x  e.  A  { x } )  =  ( R " A )
1410, 11, 133eqtr2ri 2266 . 2  |-  ( R
" A )  = 
U_ x  e.  A  [ x ] R
155, 7, 143eqtr4g 2296 1  |-  ( R  e.  V  ->  U. ( A /. R )  =  ( R " A
) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    = wceq 1402    e. wcel 2209   {cab 2224   A.wral 2528   E.wrex 2529   _Vcvv 2821   {csn 3709   U.cuni 3935   U_ciun 4012   "cima 4777   [cec 6805   /.cqs 6806
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4131  df-opab 4193  df-xp 4780  df-cnv 4782  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-ec 6809  df-qs 6813
This theorem is used by:  uniqs2  6869  ecqs  6871
  Copyright terms: Public domain W3C validator