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

Theorem dfdm3 5836
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 5635 . 2 dom 𝐴 = {𝑥 ∣ ∃𝑦 𝑥𝐴𝑦}
2 df-br 5080 . . . 4 (𝑥𝐴𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐴)
32exbii 1855 . . 3 (∃𝑦 𝑥𝐴𝑦 ↔ ∃𝑦𝑥, 𝑦⟩ ∈ 𝐴)
43abbii 2807 . 2 {𝑥 ∣ ∃𝑦 𝑥𝐴𝑦} = {𝑥 ∣ ∃𝑦𝑥, 𝑦⟩ ∈ 𝐴}
51, 4eqtri 2763 1 dom 𝐴 = {𝑥 ∣ ∃𝑦𝑥, 𝑦⟩ ∈ 𝐴}
Colors of variables: wff setvar class
Syntax hints:   = wceq 1547  wex 1786  wcel 2119  {cab 2718  cop 4568   class class class wbr 5079  dom cdm 5625
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-9 2129  ax-ext 2712
This theorem depends on definitions:  df-bi 208  df-an 397  df-ex 1787  df-sb 2074  df-clab 2719  df-cleq 2732  df-br 5080  df-dm 5635
This theorem is referenced by:  csbdm  5846  cnextf  24056  dmrab  32591
  Copyright terms: Public domain W3C validator