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

Theorem elintg 3978
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 2301 . 2  |-  ( y  =  A  ->  (
y  e.  |^| B  <->  A  e.  |^| B ) )
2 eleq1 2301 . . 3  |-  ( y  =  A  ->  (
y  e.  x  <->  A  e.  x ) )
32ralbidv 2550 . 2  |-  ( y  =  A  ->  ( A. x  e.  B  y  e.  x  <->  A. x  e.  B  A  e.  x ) )
4 vex 2824 . . 3  |-  y  e. 
_V
54elint2 3977 . 2  |-  ( y  e.  |^| B  <->  A. x  e.  B  y  e.  x )
61, 3, 5vtoclbg 2884 1  |-  ( A  e.  V  ->  ( A  e.  |^| B  <->  A. x  e.  B  A  e.  x ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    <-> wb 105    = wceq 1402    e. wcel 2209   A.wral 2528   |^|cint 3970
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This proof depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-v 2823  df-int 3971
This theorem is used by:  elinti  3979  elrint  4010  peano2  4742  pitonn  8215  peano1nnnn  8219  peano2nnnn  8220  1nn  9315  peano2nn  9316  subgintm  14001  subrngintm  14520  subrgintm  14551  lssintclm  14721
  Copyright terms: Public domain W3C validator