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

Theorem rnss 5014
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 4955 . . 3  |-  ( A 
C_  B  ->  `' A  C_  `' B )
2 dmss 4982 . . 3  |-  ( `' A  C_  `' B  ->  dom  `' A  C_  dom  `' B )
31, 2syl 14 . 2  |-  ( A 
C_  B  ->  dom  `' A  C_  dom  `' B
)
4 df-rn 4787 . 2  |-  ran  A  =  dom  `' A
5 df-rn 4787 . 2  |-  ran  B  =  dom  `' B
63, 4, 53sstr4g 3291 1  |-  ( A 
C_  B  ->  ran  A 
C_  ran  B )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    C_ wss 3220   `'ccnv 4775   dom cdm 4776   ran crn 4777
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-sn 3715  df-pr 3716  df-op 3718  df-br 4132  df-opab 4194  df-cnv 4784  df-dm 4786  df-rn 4787
This theorem is used by:  imass1  5165  imass2  5166  rnxpss2  5224  ssxpbm  5226  ssxp2  5228  ssrnres  5233  funssxp  5560  fssres  5568  dff2  5855  fliftf  6008  1stcof  6401  2ndcof  6402  smores  6567  tfrcllembfn  6632  caserel  7433  frecuzrdgtcl  10870  prdsvallem  13680  prdsval  14280  lmss  15472  txss12  15492  txbasval  15493  subgrprop3  16708
  Copyright terms: Public domain W3C validator