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

Theorem rnss 4987
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 4928 . . 3  |-  ( A 
C_  B  ->  `' A  C_  `' B )
2 dmss 4955 . . 3  |-  ( `' A  C_  `' B  ->  dom  `' A  C_  dom  `' B )
31, 2syl 14 . 2  |-  ( A 
C_  B  ->  dom  `' A  C_  dom  `' B
)
4 df-rn 4760 . 2  |-  ran  A  =  dom  `' A
5 df-rn 4760 . 2  |-  ran  B  =  dom  `' B
63, 4, 53sstr4g 3281 1  |-  ( A 
C_  B  ->  ran  A 
C_  ran  B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    C_ wss 3211   `'ccnv 4748   dom cdm 4749   ran crn 4750
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 2214
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-v 2815  df-un 3215  df-in 3217  df-ss 3224  df-sn 3695  df-pr 3696  df-op 3698  df-br 4110  df-opab 4172  df-cnv 4757  df-dm 4759  df-rn 4760
This theorem is referenced by:  imass1  5137  imass2  5138  rnxpss2  5196  ssxpbm  5198  ssxp2  5200  ssrnres  5205  funssxp  5532  fssres  5540  dff2  5821  fliftf  5972  1stcof  6357  2ndcof  6358  smores  6523  tfrcllembfn  6588  caserel  7378  frecuzrdgtcl  10774  prdsvallem  13485  prdsval  13486  lmss  15111  txss12  15131  txbasval  15132  subgrprop3  16257
  Copyright terms: Public domain W3C validator