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

Theorem dfdm3 5868
Description: Alternate definition of domain. Definition 6.5(1) of [TakeutiZaring] p. 24. (Contributed by NM, 28-Dec-1996.)
Assertion
Ref Expression
dfdm3 dom 𝐴 = {𝑥 ∣ ∃𝑦⟨𝑥, 𝑦⟩ ∈ 𝐴}
Distinct variable group:   𝑥,𝑦,𝐴

Proof of Theorem dfdm3
StepHypRef Expression
1 df-dm 5660 . 2 dom 𝐴 = {𝑥 ∣ ∃𝑦 𝑥𝐴𝑦}
2 df-br 5103 . . . 4 (𝑥𝐴𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐴)
32exbii 1880 . . 3 (∃𝑦 𝑥𝐴𝑦 ↔ ∃𝑦⟨𝑥, 𝑦⟩ ∈ 𝐴)
43abbii 2827 . 2 {𝑥 ∣ ∃𝑦 𝑥𝐴𝑦} = {𝑥 ∣ ∃𝑦⟨𝑥, 𝑦⟩ ∈ 𝐴}
51, 4eqtri 2783 1 dom 𝐴 = {𝑥 ∣ ∃𝑦⟨𝑥, 𝑦⟩ ∈ 𝐴}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1569  ∃wex 1811   ∈ wcel 2144  {cab 2738  ⟨cop 4834   class class class wbr 5102  dom cdm 5650
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-9 2154  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-br 5103  df-dm 5660
This theorem is used by:  csbdm  5878  cnextf  24391  dmrab  33141
  Copyright terms: Public domain W3C validator