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

Theorem elintg 3931
Description: Membership in class intersection, with the sethood requirement expressed as an antecedent. (Contributed by NM, 20-Nov-2003.)
Assertion
Ref Expression
elintg  |-  ( A  e.  V  ->  ( A  e.  |^| B  <->  A. x  e.  B  A  e.  x ) )
Distinct variable groups:    x, A    x, B
Allowed substitution hint:    V( x)

Proof of Theorem elintg
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 eleq1 2292 . 2  |-  ( y  =  A  ->  (
y  e.  |^| B  <->  A  e.  |^| B ) )
2 eleq1 2292 . . 3  |-  ( y  =  A  ->  (
y  e.  x  <->  A  e.  x ) )
32ralbidv 2530 . 2  |-  ( y  =  A  ->  ( A. x  e.  B  y  e.  x  <->  A. x  e.  B  A  e.  x ) )
4 vex 2802 . . 3  |-  y  e. 
_V
54elint2 3930 . 2  |-  ( y  e.  |^| B  <->  A. x  e.  B  y  e.  x )
61, 3, 5vtoclbg 2862 1  |-  ( A  e.  V  ->  ( A  e.  |^| B  <->  A. x  e.  B  A  e.  x ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    = wceq 1395    e. wcel 2200   A.wral 2508   |^|cint 3923
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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211
This theorem depends on definitions:  df-bi 117  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-v 2801  df-int 3924
This theorem is referenced by:  elinti  3932  elrint  3963  peano2  4687  pitonn  8035  peano1nnnn  8039  peano2nnnn  8040  1nn  9121  peano2nn  9122  subgintm  13735  subrngintm  14176  subrgintm  14207  lssintclm  14348
  Copyright terms: Public domain W3C validator