| 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 6000 | . 2 ⊢ (𝐴 ↾ 𝐵) ⊆ 𝐴 | |
| 2 | 1 | rnssi 5930 | 1 ⊢ ran (𝐴 ↾ 𝐵) ⊆ ran 𝐴 |
| Colors of variables: wff setvar class |
| Syntax hints: ⊆ wss 3905 ran crn 5662 ↾ cres 5663 |
| 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 |
| This theorem is referenced by: imadifssran 6202 imadifssranOLD 6203 oniso 28464 gsumhashmul 33387 esplyind 33965 nelrnres 45905 limsupvaluz2 46452 supcnvlimsup 46454 limsupgtlem 46491 sge0split 47123 |
| Copyright terms: Public domain | W3C validator |