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

Theorem dfint2 3768
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 3767 . 2  |-  |^| A  =  { x  |  A. y ( y  e.  A  ->  x  e.  y ) }
2 df-ral 2419 . . 3  |-  ( A. y  e.  A  x  e.  y  <->  A. y ( y  e.  A  ->  x  e.  y ) )
32abbii 2253 . 2  |-  { x  |  A. y  e.  A  x  e.  y }  =  { x  |  A. y ( y  e.  A  ->  x  e.  y ) }
41, 3eqtr4i 2161 1  |-  |^| A  =  { x  |  A. y  e.  A  x  e.  y }
Colors of variables: wff set class
Syntax hints:    -> wi 4   A.wal 1329    = wceq 1331    e. wcel 1480   {cab 2123   A.wral 2414   |^|cint 3766
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-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-11 1484  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119
This theorem depends on definitions:  df-bi 116  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-ral 2419  df-int 3767
This theorem is referenced by:  inteq  3769  nfint  3776  intiin  3862
  Copyright terms: Public domain W3C validator