![]() |
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 6147 | . 2 ⊢ ran ((𝐴 ↾ 𝐶) ∩ (𝐵 ↾ 𝐶)) ⊆ (ran (𝐴 ↾ 𝐶) ∩ ran (𝐵 ↾ 𝐶)) | |
2 | df-ima 5690 | . . 3 ⊢ ((𝐴 ∩ 𝐵) “ 𝐶) = ran ((𝐴 ∩ 𝐵) ↾ 𝐶) | |
3 | resindir 5999 | . . . 4 ⊢ ((𝐴 ∩ 𝐵) ↾ 𝐶) = ((𝐴 ↾ 𝐶) ∩ (𝐵 ↾ 𝐶)) | |
4 | 3 | rneqi 5937 | . . 3 ⊢ ran ((𝐴 ∩ 𝐵) ↾ 𝐶) = ran ((𝐴 ↾ 𝐶) ∩ (𝐵 ↾ 𝐶)) |
5 | 2, 4 | eqtri 2761 | . 2 ⊢ ((𝐴 ∩ 𝐵) “ 𝐶) = ran ((𝐴 ↾ 𝐶) ∩ (𝐵 ↾ 𝐶)) |
6 | df-ima 5690 | . . 3 ⊢ (𝐴 “ 𝐶) = ran (𝐴 ↾ 𝐶) | |
7 | df-ima 5690 | . . 3 ⊢ (𝐵 “ 𝐶) = ran (𝐵 ↾ 𝐶) | |
8 | 6, 7 | ineq12i 4211 | . 2 ⊢ ((𝐴 “ 𝐶) ∩ (𝐵 “ 𝐶)) = (ran (𝐴 ↾ 𝐶) ∩ ran (𝐵 ↾ 𝐶)) |
9 | 1, 5, 8 | 3sstr4i 4026 | 1 ⊢ ((𝐴 ∩ 𝐵) “ 𝐶) ⊆ ((𝐴 “ 𝐶) ∩ (𝐵 “ 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: ∩ cin 3948 ⊆ wss 3949 ran crn 5678 ↾ cres 5679 “ cima 5680 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-ext 2704 ax-sep 5300 ax-nul 5307 ax-pr 5428 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-sb 2069 df-clab 2711 df-cleq 2725 df-clel 2811 df-rab 3434 df-v 3477 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-nul 4324 df-if 4530 df-sn 4630 df-pr 4632 df-op 4636 df-br 5150 df-opab 5212 df-xp 5683 df-rel 5684 df-cnv 5685 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 |
This theorem is referenced by: restutopopn 23743 |
Copyright terms: Public domain | W3C validator |