| 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 6008 | . 2 ⊢ (𝐴 ↾ 𝐵) ⊆ 𝐴 | |
| 2 | 1 | rnssi 5934 | 1 ⊢ ran (𝐴 ↾ 𝐵) ⊆ ran 𝐴 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ⊆ wss 3900 ran crn 5659 ↾ cres 5660 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-br 5109 df-opab 5174 df-cnv 5666 df-dm 5668 df-rn 5669 df-res 5670 |
| This theorem is used by: imadifssranOLD 6221 imadifssranOLDOLD 6222 smores 8398 oniso 28714 gsumhashmul 33727 esplyind 34318 nvo3 38230 nelrnres 46475 limsupvaluz2 47021 supcnvlimsup 47023 limsupgtlem 47060 sge0split 47692 |
| Copyright terms: Public domain | W3C validator |