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

Theorem resexg 5053
Description: The restriction of a set is a set. (Contributed by NM, 28-Mar-1998.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
Assertion
Ref Expression
resexg  |-  ( A  e.  V  ->  ( A  |`  B )  e. 
_V )

Proof of Theorem resexg
StepHypRef Expression
1 resss 5037 . 2  |-  ( A  |`  B )  C_  A
2 ssexg 4228 . 2  |-  ( ( ( A  |`  B ) 
C_  A  /\  A  e.  V )  ->  ( A  |`  B )  e. 
_V )
31, 2mpan 424 1  |-  ( A  e.  V  ->  ( A  |`  B )  e. 
_V )
Colors of variables: wff set class
Syntax hints:    -> wi 4    e. wcel 2202   _Vcvv 2802    C_ wss 3200    |` cres 4727
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213  ax-sep 4207
This theorem depends on definitions:  df-bi 117  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-v 2804  df-in 3206  df-ss 3213  df-res 4737
This theorem is referenced by:  resex  5054  offres  6297  resixp  6902  seqf1oglem2  10783  climres  11881  setsvalg  13130  setsex  13132  setsslid  13151  gsumsplit1r  13499  znval  14669  znle  14670  znbaslemnn  14672  znleval  14686  uhgrspanop  16152  upgrspanop  16153  umgrspanop  16154  usgrspanop  16155  eupthvdres  16345  eupth2lem3fi  16346  eupth2lembfi  16347
  Copyright terms: Public domain W3C validator