| 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 6143 | . 2 ⊢ ran ((𝐴 ↾ 𝐶) ∩ (𝐵 ↾ 𝐶)) ⊆ (ran (𝐴 ↾ 𝐶) ∩ ran (𝐵 ↾ 𝐶)) | |
| 2 | df-ima 5674 | . . 3 ⊢ ((𝐴 ∩ 𝐵) “ 𝐶) = ran ((𝐴 ∩ 𝐵) ↾ 𝐶) | |
| 3 | resindir 5995 | . . . 4 ⊢ ((𝐴 ∩ 𝐵) ↾ 𝐶) = ((𝐴 ↾ 𝐶) ∩ (𝐵 ↾ 𝐶)) | |
| 4 | 3 | rneqi 5927 | . . 3 ⊢ ran ((𝐴 ∩ 𝐵) ↾ 𝐶) = ran ((𝐴 ↾ 𝐶) ∩ (𝐵 ↾ 𝐶)) |
| 5 | 2, 4 | eqtri 2786 | . 2 ⊢ ((𝐴 ∩ 𝐵) “ 𝐶) = ran ((𝐴 ↾ 𝐶) ∩ (𝐵 ↾ 𝐶)) |
| 6 | df-ima 5674 | . . 3 ⊢ (𝐴 “ 𝐶) = ran (𝐴 ↾ 𝐶) | |
| 7 | df-ima 5674 | . . 3 ⊢ (𝐵 “ 𝐶) = ran (𝐵 ↾ 𝐶) | |
| 8 | 6, 7 | ineq12i 4171 | . 2 ⊢ ((𝐴 “ 𝐶) ∩ (𝐵 “ 𝐶)) = (ran (𝐴 ↾ 𝐶) ∩ ran (𝐵 ↾ 𝐶)) |
| 9 | 1, 5, 8 | 3sstr4i 3988 | 1 ⊢ ((𝐴 ∩ 𝐵) “ 𝐶) ⊆ ((𝐴 “ 𝐶) ∩ (𝐵 “ 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: ∩ cin 3904 ⊆ wss 3905 ran crn 5662 ↾ cres 5663 “ cima 5664 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-sn 4590 df-pr 4592 df-op 4596 df-br 5110 df-opab 5174 df-cnv 5669 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 |
| This theorem is referenced by: restutopopn 24395 |
| Copyright terms: Public domain | W3C validator |