MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  imaundir Structured version   Visualization version   GIF version

Theorem imaundir 6144
Description: The image of a union. (Contributed by Jeff Hoffman, 17-Feb-2008.)
Assertion
Ref Expression
imaundir ((𝐴 ∪ 𝐵) “ 𝐶) = ((𝐴 “ 𝐶) ∪ (𝐵 “ 𝐶))

Proof of Theorem imaundir
StepHypRef Expression
1 df-ima 5664 . . 3 ((𝐴 ∪ 𝐵) “ 𝐶) = ran ((𝐴 ∪ 𝐵) ↾ 𝐶)
2 resundir 5986 . . . 4 ((𝐴 ∪ 𝐵) ↾ 𝐶) = ((𝐴 ↾ 𝐶) ∪ (𝐵 ↾ 𝐶))
32rneqi 5920 . . 3 ran ((𝐴 ∪ 𝐵) ↾ 𝐶) = ran ((𝐴 ↾ 𝐶) ∪ (𝐵 ↾ 𝐶))
4 rnun 6138 . . 3 ran ((𝐴 ↾ 𝐶) ∪ (𝐵 ↾ 𝐶)) = (ran (𝐴 ↾ 𝐶) ∪ ran (𝐵 ↾ 𝐶))
51, 3, 43eqtri 2787 . 2 ((𝐴 ∪ 𝐵) “ 𝐶) = (ran (𝐴 ↾ 𝐶) ∪ ran (𝐵 ↾ 𝐶))
6 df-ima 5664 . . 3 (𝐴 “ 𝐶) = ran (𝐴 ↾ 𝐶)
7 df-ima 5664 . . 3 (𝐵 “ 𝐶) = ran (𝐵 ↾ 𝐶)
86, 7uneq12i 4164 . 2 ((𝐴 “ 𝐶) ∪ (𝐵 “ 𝐶)) = (ran (𝐴 ↾ 𝐶) ∪ ran (𝐵 ↾ 𝐶))
95, 8eqtr4i 2786 1 ((𝐴 ∪ 𝐵) “ 𝐶) = ((𝐴 “ 𝐶) ∪ (𝐵 “ 𝐶))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1569   ∪ cun 4148  ran crn 5652   ↾ cres 5653   “ cima 5654
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-br 5103  df-opab 5167  df-cnv 5659  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664
This theorem is used by:  fvun  6980  suppun  8208  fsuppun  9386  fpwwe2lem12  10734  ustuqtop1  24569  mbfres2  25975  imadifxp  33246  suppun2  33328  eulerpartlemt  35053  bj-projun  38003  bj-funun  38282  poimirlem3  38650  poimirlem15  38662  brtrclfv2  44836  frege131d  44873  unhe1  44894  frege110  45082  frege133  45105  aacllem  51122
  Copyright terms: Public domain W3C validator