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

Theorem rnss 4777
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 4720 . . 3  |-  ( A 
C_  B  ->  `' A  C_  `' B )
2 dmss 4746 . . 3  |-  ( `' A  C_  `' B  ->  dom  `' A  C_  dom  `' B )
31, 2syl 14 . 2  |-  ( A 
C_  B  ->  dom  `' A  C_  dom  `' B
)
4 df-rn 4558 . 2  |-  ran  A  =  dom  `' A
5 df-rn 4558 . 2  |-  ran  B  =  dom  `' B
63, 4, 53sstr4g 3145 1  |-  ( A 
C_  B  ->  ran  A 
C_  ran  B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    C_ wss 3076   `'ccnv 4546   dom cdm 4547   ran crn 4548
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-v 2691  df-un 3080  df-in 3082  df-ss 3089  df-sn 3538  df-pr 3539  df-op 3541  df-br 3938  df-opab 3998  df-cnv 4555  df-dm 4557  df-rn 4558
This theorem is referenced by:  imass1  4922  imass2  4923  rnxpss2  4980  ssxpbm  4982  ssxp2  4984  ssrnres  4989  funssxp  5300  fssres  5306  dff2  5572  fliftf  5708  1stcof  6069  2ndcof  6070  smores  6197  tfrcllembfn  6262  caserel  6980  frecuzrdgtcl  10216  lmss  12454  txss12  12474  txbasval  12475
  Copyright terms: Public domain W3C validator