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

Theorem inex1g 4225
Description: Closed-form, generalized Separation Scheme. (Contributed by NM, 7-Apr-1995.)
Assertion
Ref Expression
inex1g  |-  ( A  e.  V  ->  ( A  i^i  B )  e. 
_V )

Proof of Theorem inex1g
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 ineq1 3401 . . 3  |-  ( x  =  A  ->  (
x  i^i  B )  =  ( A  i^i  B ) )
21eleq1d 2300 . 2  |-  ( x  =  A  ->  (
( x  i^i  B
)  e.  _V  <->  ( A  i^i  B )  e.  _V ) )
3 vex 2805 . . 3  |-  x  e. 
_V
43inex1 4223 . 2  |-  ( x  i^i  B )  e. 
_V
52, 4vtoclg 2864 1  |-  ( A  e.  V  ->  ( A  i^i  B )  e. 
_V )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1397    e. wcel 2202   _Vcvv 2802    i^i cin 3199
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
This theorem is referenced by:  onin  4483  dmresexg  5036  funimaexg  5414  offval  6243  offval3  6296  ssenen  7037  ressvalsets  13149  ressex  13150  ressbasd  13152  resseqnbasd  13158  ressinbasd  13159  ressressg  13160  qusin  13411  mgpress  13947  isunitd  14123  isrhm  14175  rhmfn  14189  rhmval  14190  2idlval  14519  2idlvalg  14520  eltg  14779  eltg3  14784  ntrval  14837  restco  14901  wlk1walkdom  16213
  Copyright terms: Public domain W3C validator