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

Theorem imaundir 5017
Description: The image of a union. (Contributed by Jeff Hoffman, 17-Feb-2008.)
Assertion
Ref Expression
imaundir  |-  ( ( A  u.  B )
" C )  =  ( ( A " C )  u.  ( B " C ) )

Proof of Theorem imaundir
StepHypRef Expression
1 df-ima 4617 . . 3  |-  ( ( A  u.  B )
" C )  =  ran  ( ( A  u.  B )  |`  C )
2 resundir 4898 . . . 4  |-  ( ( A  u.  B )  |`  C )  =  ( ( A  |`  C )  u.  ( B  |`  C ) )
32rneqi 4832 . . 3  |-  ran  (
( A  u.  B
)  |`  C )  =  ran  ( ( A  |`  C )  u.  ( B  |`  C ) )
4 rnun 5012 . . 3  |-  ran  (
( A  |`  C )  u.  ( B  |`  C ) )  =  ( ran  ( A  |`  C )  u.  ran  ( B  |`  C ) )
51, 3, 43eqtri 2190 . 2  |-  ( ( A  u.  B )
" C )  =  ( ran  ( A  |`  C )  u.  ran  ( B  |`  C ) )
6 df-ima 4617 . . 3  |-  ( A
" C )  =  ran  ( A  |`  C )
7 df-ima 4617 . . 3  |-  ( B
" C )  =  ran  ( B  |`  C )
86, 7uneq12i 3274 . 2  |-  ( ( A " C )  u.  ( B " C ) )  =  ( ran  ( A  |`  C )  u.  ran  ( B  |`  C ) )
95, 8eqtr4i 2189 1  |-  ( ( A  u.  B )
" C )  =  ( ( A " C )  u.  ( B " C ) )
Colors of variables: wff set class
Syntax hints:    = wceq 1343    u. cun 3114   ran crn 4605    |` cres 4606   "cima 4607
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 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-ext 2147
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-v 2728  df-un 3120  df-in 3122  df-ss 3129  df-sn 3582  df-pr 3583  df-op 3585  df-br 3983  df-opab 4044  df-cnv 4612  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617
This theorem is referenced by:  fvun1  5552
  Copyright terms: Public domain W3C validator