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

Theorem rabexg 4079
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 3187 . 2  |-  { x  e.  A  |  ph }  C_  A
2 ssexg 4075 . 2  |-  ( ( { x  e.  A  |  ph }  C_  A  /\  A  e.  V
)  ->  { x  e.  A  |  ph }  e.  _V )
31, 2mpan 421 1  |-  ( A  e.  V  ->  { x  e.  A  |  ph }  e.  _V )
Colors of variables: wff set class
Syntax hints:    -> wi 4    e. wcel 1481   {crab 2421   _Vcvv 2689    C_ wss 3076
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  ax-sep 4054
This theorem depends on definitions:  df-bi 116  df-tru 1335  df-nf 1438  df-sb 1737  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-rab 2426  df-v 2691  df-in 3082  df-ss 3089
This theorem is referenced by:  rabex  4080  exmidsssnc  4134  exse  4266  frind  4282  elfvmptrab1  5523  mpoxopoveq  6145  diffitest  6789  cc4f  7101  omctfn  11992  epttop  12298  cldval  12307  neif  12349  neival  12351  cnfval  12402  cnovex  12404  cnpval  12406  hmeofn  12510  hmeofvalg  12511  ispsmet  12531  ismet  12552  isxmet  12553  blvalps  12596  blval  12597  cncfval  12767
  Copyright terms: Public domain W3C validator