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

Theorem dfdm3 4883
Description: Alternate definition of domain. Definition 6.5(1) of [TakeutiZaring] p. 24. (Contributed by NM, 28-Dec-1996.)
Assertion
Ref Expression
dfdm3  |-  dom  A  =  { x  |  E. y <. x ,  y
>.  e.  A }
Distinct variable group:    x, y, A

Proof of Theorem dfdm3
StepHypRef Expression
1 df-dm 4715 . 2  |-  dom  A  =  { x  |  E. y  x A y }
2 df-br 4040 . . . 4  |-  ( x A y  <->  <. x ,  y >.  e.  A
)
32exbii 1572 . . 3  |-  ( E. y  x A y  <->  E. y <. x ,  y
>.  e.  A )
43abbii 2408 . 2  |-  { x  |  E. y  x A y }  =  {
x  |  E. y <. x ,  y >.  e.  A }
51, 4eqtri 2316 1  |-  dom  A  =  { x  |  E. y <. x ,  y
>.  e.  A }
Colors of variables: wff set class
Syntax hints:   E.wex 1531    = wceq 1632    e. wcel 1696   {cab 2282   <.cop 3656   class class class wbr 4039   dom cdm 4705
This theorem is referenced by:  prjdmn  25185  csbdmg  28085
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277
This theorem depends on definitions:  df-bi 177  df-an 360  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-clab 2283  df-cleq 2289  df-br 4040  df-dm 4715
  Copyright terms: Public domain W3C validator