ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  rnss Unicode version

Theorem rnss 4968
Description: Subset theorem for range. (Contributed by NM, 22-Mar-1998.)
Assertion
Ref Expression
rnss  |-  ( A 
C_  B  ->  ran  A 
C_  ran  B )

Proof of Theorem rnss
StepHypRef Expression
1 cnvss 4909 . . 3  |-  ( A 
C_  B  ->  `' A  C_  `' B )
2 dmss 4936 . . 3  |-  ( `' A  C_  `' B  ->  dom  `' A  C_  dom  `' B )
31, 2syl 14 . 2  |-  ( A 
C_  B  ->  dom  `' A  C_  dom  `' B
)
4 df-rn 4742 . 2  |-  ran  A  =  dom  `' A
5 df-rn 4742 . 2  |-  ran  B  =  dom  `' B
63, 4, 53sstr4g 3271 1  |-  ( A 
C_  B  ->  ran  A 
C_  ran  B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    C_ wss 3201   `'ccnv 4730   dom cdm 4731   ran crn 4732
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-v 2805  df-un 3205  df-in 3207  df-ss 3214  df-sn 3679  df-pr 3680  df-op 3682  df-br 4094  df-opab 4156  df-cnv 4739  df-dm 4741  df-rn 4742
This theorem is referenced by:  imass1  5118  imass2  5119  rnxpss2  5177  ssxpbm  5179  ssxp2  5181  ssrnres  5186  funssxp  5512  fssres  5520  dff2  5799  fliftf  5950  1stcof  6335  2ndcof  6336  smores  6501  tfrcllembfn  6566  caserel  7329  frecuzrdgtcl  10720  prdsvallem  13418  prdsval  13419  lmss  15040  txss12  15060  txbasval  15061  subgrprop3  16186
  Copyright terms: Public domain W3C validator