![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > imaundir | Structured version Visualization version GIF version |
Description: The image of a union. (Contributed by Jeff Hoffman, 17-Feb-2008.) |
Ref | Expression |
---|---|
imaundir | ⊢ ((𝐴 ∪ 𝐵) “ 𝐶) = ((𝐴 “ 𝐶) ∪ (𝐵 “ 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-ima 5713 | . . 3 ⊢ ((𝐴 ∪ 𝐵) “ 𝐶) = ran ((𝐴 ∪ 𝐵) ↾ 𝐶) | |
2 | resundir 6024 | . . . 4 ⊢ ((𝐴 ∪ 𝐵) ↾ 𝐶) = ((𝐴 ↾ 𝐶) ∪ (𝐵 ↾ 𝐶)) | |
3 | 2 | rneqi 5962 | . . 3 ⊢ ran ((𝐴 ∪ 𝐵) ↾ 𝐶) = ran ((𝐴 ↾ 𝐶) ∪ (𝐵 ↾ 𝐶)) |
4 | rnun 6177 | . . 3 ⊢ ran ((𝐴 ↾ 𝐶) ∪ (𝐵 ↾ 𝐶)) = (ran (𝐴 ↾ 𝐶) ∪ ran (𝐵 ↾ 𝐶)) | |
5 | 1, 3, 4 | 3eqtri 2772 | . 2 ⊢ ((𝐴 ∪ 𝐵) “ 𝐶) = (ran (𝐴 ↾ 𝐶) ∪ ran (𝐵 ↾ 𝐶)) |
6 | df-ima 5713 | . . 3 ⊢ (𝐴 “ 𝐶) = ran (𝐴 ↾ 𝐶) | |
7 | df-ima 5713 | . . 3 ⊢ (𝐵 “ 𝐶) = ran (𝐵 ↾ 𝐶) | |
8 | 6, 7 | uneq12i 4189 | . 2 ⊢ ((𝐴 “ 𝐶) ∪ (𝐵 “ 𝐶)) = (ran (𝐴 ↾ 𝐶) ∪ ran (𝐵 ↾ 𝐶)) |
9 | 5, 8 | eqtr4i 2771 | 1 ⊢ ((𝐴 ∪ 𝐵) “ 𝐶) = ((𝐴 “ 𝐶) ∪ (𝐵 “ 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1537 ∪ cun 3974 ran crn 5701 ↾ cres 5702 “ cima 5703 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-12 2178 ax-ext 2711 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-clab 2718 df-cleq 2732 df-clel 2819 df-rab 3444 df-v 3490 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-sn 4649 df-pr 4651 df-op 4655 df-br 5167 df-opab 5229 df-cnv 5708 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 |
This theorem is referenced by: fvun 7012 suppun 8225 fsuppun 9456 fpwwe2lem12 10711 ustuqtop1 24271 mbfres2 25699 imadifxp 32623 eulerpartlemt 34336 bj-projun 36960 bj-funun 37218 poimirlem3 37583 poimirlem15 37595 brtrclfv2 43689 frege131d 43726 unhe1 43747 frege110 43935 frege133 43958 aacllem 48895 |
Copyright terms: Public domain | W3C validator |