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 5848 | . 2 ⊢ (𝐴 ⊆ 𝐵 → ran 𝐴 ⊆ ran 𝐵) | |
3 | 1, 2 | ax-mp 5 | 1 ⊢ ran 𝐴 ⊆ ran 𝐵 |
Colors of variables: wff setvar class |
Syntax hints: ⊆ wss 3887 ran crn 5590 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-rab 3073 df-v 3434 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-br 5075 df-opab 5137 df-cnv 5597 df-dm 5599 df-rn 5600 |
This theorem is referenced by: rnresss 5927 ssrnres 6081 fssres 6640 smores 8183 rnttrcl 9480 brdom4 10286 smobeth 10342 nqerf 10686 catcoppccl 17832 catcoppcclOLD 17833 lern 18309 gsumzres 19510 gsumzaddlem 19522 gsumzadd 19523 dprdfadd 19623 txkgen 22803 dvlog 25806 perpln2 27072 pfxrn2 31214 fixssrn 34209 cnvrcl0 41233 |
Copyright terms: Public domain | W3C validator |