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

Theorem imaundir 6160
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 5671 . . 3 ((𝐴 ∪ 𝐵) “ 𝐶) = ran ((𝐴 ∪ 𝐵) ↾ 𝐶)
2 resundir 6001 . . . 4 ((𝐴 ∪ 𝐵) ↾ 𝐶) = ((𝐴 ↾ 𝐶) ∪ (𝐵 ↾ 𝐶))
32rneqi 5931 . . 3 ran ((𝐴 ∪ 𝐵) ↾ 𝐶) = ran ((𝐴 ↾ 𝐶) ∪ (𝐵 ↾ 𝐶))
4 rnun 6154 . . 3 ran ((𝐴 ↾ 𝐶) ∪ (𝐵 ↾ 𝐶)) = (ran (𝐴 ↾ 𝐶) ∪ ran (𝐵 ↾ 𝐶))
51, 3, 43eqtri 2790 . 2 ((𝐴 ∪ 𝐵) “ 𝐶) = (ran (𝐴 ↾ 𝐶) ∪ ran (𝐵 ↾ 𝐶))
6 df-ima 5671 . . 3 (𝐴 “ 𝐶) = ran (𝐴 ↾ 𝐶)
7 df-ima 5671 . . 3 (𝐵 “ 𝐶) = ran (𝐵 ↾ 𝐶)
86, 7uneq12i 4168 . 2 ((𝐴 “ 𝐶) ∪ (𝐵 “ 𝐶)) = (ran (𝐴 ↾ 𝐶) ∪ ran (𝐵 ↾ 𝐶))
95, 8eqtr4i 2789 1 ((𝐴 ∪ 𝐵) “ 𝐶) = ((𝐴 “ 𝐶) ∪ (𝐵 “ 𝐶))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570   ∪ cun 4152  ran crn 5659   ↾ cres 5660   “ cima 5661
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-br 5109  df-opab 5174  df-cnv 5666  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671
This theorem is used by:  fvun  7006  suppun  8239  fsuppun  9416  fpwwe2lem12  10766  ustuqtop1  24615  mbfres2  26021  imadifxp  33293  suppun2  33374  eulerpartlemt  35114  bj-projun  38122  bj-funun  38441  poimirlem3  38809  poimirlem15  38821  brtrclfv2  44988  frege131d  45025  unhe1  45046  frege110  45234  frege133  45257  aacllem  51367
  Copyright terms: Public domain W3C validator