MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  dfint2 Structured version   Unicode version

Theorem dfint2 4284
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 4283 . 2  |-  |^| A  =  { x  |  A. y ( y  e.  A  ->  x  e.  y ) }
2 df-ral 2819 . . 3  |-  ( A. y  e.  A  x  e.  y  <->  A. y ( y  e.  A  ->  x  e.  y ) )
32abbii 2601 . 2  |-  { x  |  A. y  e.  A  x  e.  y }  =  { x  |  A. y ( y  e.  A  ->  x  e.  y ) }
41, 3eqtr4i 2499 1  |-  |^| A  =  { x  |  A. y  e.  A  x  e.  y }
Colors of variables: wff setvar class
Syntax hints:    -> wi 4   A.wal 1377    = wceq 1379    e. wcel 1767   {cab 2452   A.wral 2814   |^|cint 4282
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1601  ax-4 1612  ax-5 1680  ax-6 1719  ax-7 1739  ax-10 1786  ax-11 1791  ax-12 1803  ax-13 1968  ax-ext 2445
This theorem depends on definitions:  df-bi 185  df-an 371  df-tru 1382  df-ex 1597  df-nf 1600  df-sb 1712  df-clab 2453  df-cleq 2459  df-clel 2462  df-ral 2819  df-int 4283
This theorem is referenced by:  inteq  4285  nfint  4292  intiin  4379  dfint3  29207
  Copyright terms: Public domain W3C validator