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

Theorem dfdm3 5879
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 5673 . 2 dom 𝐴 = {𝑥 ∣ ∃𝑦 𝑥𝐴𝑦}
2 df-br 5112 . . . 4 (𝑥𝐴𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐴)
32exbii 1881 . . 3 (∃𝑦 𝑥𝐴𝑦 ↔ ∃𝑦𝑥, 𝑦⟩ ∈ 𝐴)
43abbii 2832 . 2 {𝑥 ∣ ∃𝑦 𝑥𝐴𝑦} = {𝑥 ∣ ∃𝑦𝑥, 𝑦⟩ ∈ 𝐴}
51, 4eqtri 2788 1 dom 𝐴 = {𝑥 ∣ ∃𝑦𝑥, 𝑦⟩ ∈ 𝐴}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570  wex 1812  wcel 2146  {cab 2743  cop 4597   class class class wbr 5111  dom cdm 5663
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-9 2156  ax-ext 2737
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-br 5112  df-dm 5673
This theorem is used by:  csbdm  5889  cnextf  24252  dmrab  32872
  Copyright terms: Public domain W3C validator