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

Theorem dfint2 3638
Description: Alternate definition of class intersection. (Contributed by NM, 28-Jun-1998.)
Assertion
Ref Expression
dfint2  |-  |^| A  =  { x  |  A. y  e.  A  x  e.  y }
Distinct variable group:    x, y, A

Proof of Theorem dfint2
StepHypRef Expression
1 df-int 3637 . 2  |-  |^| A  =  { x  |  A. y ( y  e.  A  ->  x  e.  y ) }
2 df-ral 2353 . . 3  |-  ( A. y  e.  A  x  e.  y  <->  A. y ( y  e.  A  ->  x  e.  y ) )
32abbii 2194 . 2  |-  { x  |  A. y  e.  A  x  e.  y }  =  { x  |  A. y ( y  e.  A  ->  x  e.  y ) }
41, 3eqtr4i 2104 1  |-  |^| A  =  { x  |  A. y  e.  A  x  e.  y }
Colors of variables: wff set class
Syntax hints:    -> wi 4   A.wal 1282    = wceq 1284    e. wcel 1433   {cab 2067   A.wral 2348   |^|cint 3636
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-11 1437  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063
This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-ral 2353  df-int 3637
This theorem is referenced by:  inteq  3639  nfint  3646  intiin  3732
  Copyright terms: Public domain W3C validator