| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rnssi | Structured version Visualization version GIF version | ||
| Description: Subclass inference for range. (Contributed by Peter Mazsa, 24-Sep-2022.) |
| Ref | Expression |
|---|---|
| rnssi.1 | ⊢ 𝐴 ⊆ 𝐵 |
| Ref | Expression |
|---|---|
| rnssi | ⊢ ran 𝐴 ⊆ ran 𝐵 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rnssi.1 | . 2 ⊢ 𝐴 ⊆ 𝐵 | |
| 2 | rnss 5924 | . 2 ⊢ (𝐴 ⊆ 𝐵 → ran 𝐴 ⊆ ran 𝐵) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ ran 𝐴 ⊆ ran 𝐵 |
| Colors of variables: wff setvar class |
| Syntax hints: ⊆ wss 3931 ran crn 5660 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2066 df-clab 2715 df-cleq 2728 df-clel 2810 df-rab 3421 df-v 3466 df-dif 3934 df-un 3936 df-ss 3948 df-nul 4314 df-if 4506 df-sn 4607 df-pr 4609 df-op 4613 df-br 5125 df-opab 5187 df-cnv 5667 df-dm 5669 df-rn 5670 |
| This theorem is referenced by: rnresss 6009 ssrnres 6172 fssres 6749 smores 8371 rnttrcl 9741 brdom4 10549 smobeth 10605 nqerf 10949 catcoppccl 18135 lern 18606 gsumzres 19895 gsumzaddlem 19907 gsumzadd 19908 dprdfadd 20008 txkgen 23595 dvlog 26617 perpln2 28695 pfxrn2 32920 fixssrn 35930 cnvrcl0 43616 |
| Copyright terms: Public domain | W3C validator |