| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > inimass | Structured version Visualization version GIF version | ||
| Description: The image of an intersection. (Contributed by Thierry Arnoux, 16-Dec-2017.) |
| Ref | Expression |
|---|---|
| inimass | ⊢ ((𝐴 ∩ 𝐵) “ 𝐶) ⊆ ((𝐴 “ 𝐶) ∩ (𝐵 “ 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rnin 6116 | . 2 ⊢ ran ((𝐴 ↾ 𝐶) ∩ (𝐵 ↾ 𝐶)) ⊆ (ran (𝐴 ↾ 𝐶) ∩ ran (𝐵 ↾ 𝐶)) | |
| 2 | df-ima 5649 | . . 3 ⊢ ((𝐴 ∩ 𝐵) “ 𝐶) = ran ((𝐴 ∩ 𝐵) ↾ 𝐶) | |
| 3 | resindir 5971 | . . . 4 ⊢ ((𝐴 ∩ 𝐵) ↾ 𝐶) = ((𝐴 ↾ 𝐶) ∩ (𝐵 ↾ 𝐶)) | |
| 4 | 3 | rneqi 5902 | . . 3 ⊢ ran ((𝐴 ∩ 𝐵) ↾ 𝐶) = ran ((𝐴 ↾ 𝐶) ∩ (𝐵 ↾ 𝐶)) |
| 5 | 2, 4 | eqtri 2775 | . 2 ⊢ ((𝐴 ∩ 𝐵) “ 𝐶) = ran ((𝐴 ↾ 𝐶) ∩ (𝐵 ↾ 𝐶)) |
| 6 | df-ima 5649 | . . 3 ⊢ (𝐴 “ 𝐶) = ran (𝐴 ↾ 𝐶) | |
| 7 | df-ima 5649 | . . 3 ⊢ (𝐵 “ 𝐶) = ran (𝐵 ↾ 𝐶) | |
| 8 | 6, 7 | ineq12i 4161 | . 2 ⊢ ((𝐴 “ 𝐶) ∩ (𝐵 “ 𝐶)) = (ran (𝐴 ↾ 𝐶) ∩ ran (𝐵 ↾ 𝐶)) |
| 9 | 1, 5, 8 | 3sstr4i 3978 | 1 ⊢ ((𝐴 ∩ 𝐵) “ 𝐶) ⊆ ((𝐴 “ 𝐶) ∩ (𝐵 “ 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: ∩ cin 3894 ⊆ wss 3895 ran crn 5637 ↾ cres 5638 “ cima 5639 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1805 ax-4 1819 ax-5 1920 ax-6 1977 ax-7 2018 ax-8 2134 ax-9 2142 ax-ext 2724 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3an 1097 df-tru 1553 df-fal 1563 df-ex 1790 df-sb 2081 df-clab 2731 df-cleq 2744 df-clel 2827 df-rab 3405 df-v 3446 df-dif 3898 df-un 3900 df-in 3902 df-ss 3912 df-nul 4277 df-if 4471 df-sn 4573 df-pr 4575 df-op 4579 df-br 5091 df-opab 5153 df-cnv 5644 df-dm 5646 df-rn 5647 df-res 5648 df-ima 5649 |
| This theorem is referenced by: restutopopn 24267 |
| Copyright terms: Public domain | W3C validator |