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

Theorem imaundir 5083
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 4676 . . 3  |-  ( ( A  u.  B )
" C )  =  ran  ( ( A  u.  B )  |`  C )
2 resundir 4960 . . . 4  |-  ( ( A  u.  B )  |`  C )  =  ( ( A  |`  C )  u.  ( B  |`  C ) )
32rneqi 4894 . . 3  |-  ran  (
( A  u.  B
)  |`  C )  =  ran  ( ( A  |`  C )  u.  ( B  |`  C ) )
4 rnun 5078 . . 3  |-  ran  (
( A  |`  C )  u.  ( B  |`  C ) )  =  ( ran  ( A  |`  C )  u.  ran  ( B  |`  C ) )
51, 3, 43eqtri 2221 . 2  |-  ( ( A  u.  B )
" C )  =  ( ran  ( A  |`  C )  u.  ran  ( B  |`  C ) )
6 df-ima 4676 . . 3  |-  ( A
" C )  =  ran  ( A  |`  C )
7 df-ima 4676 . . 3  |-  ( B
" C )  =  ran  ( B  |`  C )
86, 7uneq12i 3315 . 2  |-  ( ( A " C )  u.  ( B " C ) )  =  ( ran  ( A  |`  C )  u.  ran  ( B  |`  C ) )
95, 8eqtr4i 2220 1  |-  ( ( A  u.  B )
" C )  =  ( ( A " C )  u.  ( B " C ) )
Colors of variables: wff set class
Syntax hints:    = wceq 1364    u. cun 3155   ran crn 4664    |` cres 4665   "cima 4666
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-ext 2178
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-v 2765  df-un 3161  df-in 3163  df-ss 3170  df-sn 3628  df-pr 3629  df-op 3631  df-br 4034  df-opab 4095  df-cnv 4671  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676
This theorem is referenced by:  fvun1  5627
  Copyright terms: Public domain W3C validator