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

Theorem uniqs 6455
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 6401 . . . . 5  |-  ( R  e.  V  ->  [ x ] R  e.  _V )
21ralrimivw 2483 . . . 4  |-  ( R  e.  V  ->  A. x  e.  A  [ x ] R  e.  _V )
3 dfiun2g 3815 . . . 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 2123 . 2  |-  ( R  e.  V  ->  U. {
y  |  E. x  e.  A  y  =  [ x ] R }  =  U_ x  e.  A  [ x ] R )
6 df-qs 6403 . . 3  |-  ( A /. R )  =  { y  |  E. x  e.  A  y  =  [ x ] R }
76unieqi 3716 . 2  |-  U. ( A /. R )  = 
U. { y  |  E. x  e.  A  y  =  [ x ] R }
8 df-ec 6399 . . . . 5  |-  [ x ] R  =  ( R " { x }
)
98a1i 9 . . . 4  |-  ( x  e.  A  ->  [ x ] R  =  ( R " { x }
) )
109iuneq2i 3801 . . 3  |-  U_ x  e.  A  [ x ] R  =  U_ x  e.  A  ( R " { x }
)
11 imaiun 5629 . . 3  |-  ( R
" U_ x  e.  A  { x } )  =  U_ x  e.  A  ( R " { x } )
12 iunid 3838 . . . 4  |-  U_ x  e.  A  { x }  =  A
1312imaeq2i 4849 . . 3  |-  ( R
" U_ x  e.  A  { x } )  =  ( R " A )
1410, 11, 133eqtr2ri 2145 . 2  |-  ( R
" A )  = 
U_ x  e.  A  [ x ] R
155, 7, 143eqtr4g 2175 1  |-  ( R  e.  V  ->  U. ( A /. R )  =  ( R " A
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1316    e. wcel 1465   {cab 2103   A.wral 2393   E.wrex 2394   _Vcvv 2660   {csn 3497   U.cuni 3706   U_ciun 3783   "cima 4512   [cec 6395   /.cqs 6396
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 683  ax-5 1408  ax-7 1409  ax-gen 1410  ax-ie1 1454  ax-ie2 1455  ax-8 1467  ax-10 1468  ax-11 1469  ax-i12 1470  ax-bndl 1471  ax-4 1472  ax-13 1476  ax-14 1477  ax-17 1491  ax-i9 1495  ax-ial 1499  ax-i5r 1500  ax-ext 2099  ax-sep 4016  ax-pow 4068  ax-pr 4101  ax-un 4325
This theorem depends on definitions:  df-bi 116  df-3an 949  df-tru 1319  df-nf 1422  df-sb 1721  df-eu 1980  df-mo 1981  df-clab 2104  df-cleq 2110  df-clel 2113  df-nfc 2247  df-ral 2398  df-rex 2399  df-v 2662  df-un 3045  df-in 3047  df-ss 3054  df-pw 3482  df-sn 3503  df-pr 3504  df-op 3506  df-uni 3707  df-iun 3785  df-br 3900  df-opab 3960  df-xp 4515  df-cnv 4517  df-dm 4519  df-rn 4520  df-res 4521  df-ima 4522  df-ec 6399  df-qs 6403
This theorem is referenced by:  uniqs2  6457  ecqs  6459
  Copyright terms: Public domain W3C validator