HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem rnss 3342
Description: Subset theorem for range.
Assertion
Ref Expression
rnss |- (A (_ B -> ran A (_ ran B)

Proof of Theorem rnss
StepHypRef Expression
1 cnvss 3291 . . 3 |- (A (_ B -> `'A (_ `'B)
2 dmss 3310 . . 3 |- (`'A (_ `'B -> dom `' A (_ dom `' B)
31, 2syl 10 . 2 |- (A (_ B -> dom `' A (_ dom `' B)
4 df-rn 3189 . 2 |- ran A = dom `' A
5 df-rn 3189 . 2 |- ran B = dom `' B
63, 4, 53sstr4g 2102 1 |- (A (_ B -> ran A (_ ran B)
Colors of variables: wff set class
Syntax hints:   -> wi 3   (_ wss 2047  `'ccnv 3169  dom cdm 3170  ran crn 3171
This theorem is referenced by:  imass1 3432  imass2 3433  ssxpr 3475  ssrnres 3481  funssxp 3638  fssres 3643  dff4 3816  dff2 3817  1stcof 4101  mapval2 4335  fodom 4798  brdom4 4803  infxpidmlem7 7558  lmsslem 7952  sspba 8386  rnhmph 10533  relrded 10675  relrcat 10696
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-11 967  ax-12 968  ax-13 969  ax-14 970  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459  ax-sep 2703  ax-pow 2742  ax-pr 2779
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 981  df-sb 1172  df-eu 1382  df-mo 1383  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1587  df-v 1812  df-dif 2049  df-un 2050  df-in 2051  df-ss 2053  df-nul 2281  df-pw 2402  df-sn 2412  df-pr 2413  df-op 2416  df-br 2620  df-opab 2667  df-cnv 3186  df-dm 3188  df-rn 3189
Copyright terms: Public domain