| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > imaundir | 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 4762 | . . 3 ⊢ ((𝐴 ∪ 𝐵) “ 𝐶) = ran ((𝐴 ∪ 𝐵) ↾ 𝐶) | |
| 2 | resundir 5052 | . . . 4 ⊢ ((𝐴 ∪ 𝐵) ↾ 𝐶) = ((𝐴 ↾ 𝐶) ∪ (𝐵 ↾ 𝐶)) | |
| 3 | 2 | rneqi 4985 | . . 3 ⊢ ran ((𝐴 ∪ 𝐵) ↾ 𝐶) = ran ((𝐴 ↾ 𝐶) ∪ (𝐵 ↾ 𝐶)) |
| 4 | rnun 5171 | . . 3 ⊢ ran ((𝐴 ↾ 𝐶) ∪ (𝐵 ↾ 𝐶)) = (ran (𝐴 ↾ 𝐶) ∪ ran (𝐵 ↾ 𝐶)) | |
| 5 | 1, 3, 4 | 3eqtri 2257 | . 2 ⊢ ((𝐴 ∪ 𝐵) “ 𝐶) = (ran (𝐴 ↾ 𝐶) ∪ ran (𝐵 ↾ 𝐶)) |
| 6 | df-ima 4762 | . . 3 ⊢ (𝐴 “ 𝐶) = ran (𝐴 ↾ 𝐶) | |
| 7 | df-ima 4762 | . . 3 ⊢ (𝐵 “ 𝐶) = ran (𝐵 ↾ 𝐶) | |
| 8 | 6, 7 | uneq12i 3371 | . 2 ⊢ ((𝐴 “ 𝐶) ∪ (𝐵 “ 𝐶)) = (ran (𝐴 ↾ 𝐶) ∪ ran (𝐵 ↾ 𝐶)) |
| 9 | 5, 8 | eqtr4i 2256 | 1 ⊢ ((𝐴 ∪ 𝐵) “ 𝐶) = ((𝐴 “ 𝐶) ∪ (𝐵 “ 𝐶)) |
| Colors of variables: wff set class |
| Syntax hints: = wceq 1398 ∪ cun 3209 ran crn 4750 ↾ cres 4751 “ cima 4752 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2214 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1812 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-v 2815 df-un 3215 df-in 3217 df-ss 3224 df-sn 3695 df-pr 3696 df-op 3698 df-br 4110 df-opab 4172 df-cnv 4757 df-dm 4759 df-rn 4760 df-res 4761 df-ima 4762 |
| This theorem is referenced by: fvun1 5743 |
| Copyright terms: Public domain | W3C validator |