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

Theorem rabexg 4066
Description: Separation Scheme in terms of a restricted class abstraction. (Contributed by NM, 23-Oct-1999.)
Assertion
Ref Expression
rabexg  |-  ( A  e.  V  ->  { x  e.  A  |  ph }  e.  _V )
Distinct variable group:    x, A
Allowed substitution hints:    ph( x)    V( x)

Proof of Theorem rabexg
StepHypRef Expression
1 ssrab2 3177 . 2  |-  { x  e.  A  |  ph }  C_  A
2 ssexg 4062 . 2  |-  ( ( { x  e.  A  |  ph }  C_  A  /\  A  e.  V
)  ->  { x  e.  A  |  ph }  e.  _V )
31, 2mpan 420 1  |-  ( A  e.  V  ->  { x  e.  A  |  ph }  e.  _V )
Colors of variables: wff set class
Syntax hints:    -> wi 4    e. wcel 1480   {crab 2418   _Vcvv 2681    C_ wss 3066
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 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041
This theorem depends on definitions:  df-bi 116  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-rab 2423  df-v 2683  df-in 3072  df-ss 3079
This theorem is referenced by:  rabex  4067  exmidsssnc  4121  exse  4253  frind  4269  elfvmptrab1  5508  mpoxopoveq  6130  diffitest  6774  epttop  12248  cldval  12257  neif  12299  neival  12301  cnfval  12352  cnovex  12354  cnpval  12356  hmeofn  12460  hmeofvalg  12461  ispsmet  12481  ismet  12502  isxmet  12503  blvalps  12546  blval  12547  cncfval  12717
  Copyright terms: Public domain W3C validator