| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rnresss | Structured version Visualization version GIF version | ||
| Description: The range of a restriction is a subset of the whole range. (Contributed by Glauco Siliprandi, 17-Aug-2020.) |
| Ref | Expression |
|---|---|
| rnresss | ⊢ ran (𝐴 ↾ 𝐵) ⊆ ran 𝐴 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | resss 5960 | . 2 ⊢ (𝐴 ↾ 𝐵) ⊆ 𝐴 | |
| 2 | 1 | rnssi 5889 | 1 ⊢ ran (𝐴 ↾ 𝐵) ⊆ ran 𝐴 |
| Colors of variables: wff setvar class |
| Syntax hints: ⊆ wss 3890 ran crn 5625 ↾ cres 5626 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-br 5087 df-opab 5149 df-cnv 5632 df-dm 5634 df-rn 5635 df-res 5636 |
| This theorem is referenced by: imadifssran 6109 oniso 28277 gsumhashmul 33143 esplyind 33734 nelrnres 45635 limsupvaluz2 46184 supcnvlimsup 46186 limsupgtlem 46223 sge0split 46855 |
| Copyright terms: Public domain | W3C validator |