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

Theorem dmuni 5256
Description: The domain of a union. Part of Exercise 8 of [Enderton] p. 41. (Contributed by NM, 3-Feb-2004.)
Assertion
Ref Expression
dmuni dom 𝐴 = 𝑥𝐴 dom 𝑥
Distinct variable group:   𝑥,𝐴

Proof of Theorem dmuni
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 excom 2029 . . . . 5 (∃𝑧𝑥(⟨𝑦, 𝑧⟩ ∈ 𝑥𝑥𝐴) ↔ ∃𝑥𝑧(⟨𝑦, 𝑧⟩ ∈ 𝑥𝑥𝐴))
2 ancom 465 . . . . . . 7 ((∃𝑧𝑦, 𝑧⟩ ∈ 𝑥𝑥𝐴) ↔ (𝑥𝐴 ∧ ∃𝑧𝑦, 𝑧⟩ ∈ 𝑥))
3 19.41v 1901 . . . . . . 7 (∃𝑧(⟨𝑦, 𝑧⟩ ∈ 𝑥𝑥𝐴) ↔ (∃𝑧𝑦, 𝑧⟩ ∈ 𝑥𝑥𝐴))
4 vex 3176 . . . . . . . . 9 𝑦 ∈ V
54eldm2 5244 . . . . . . . 8 (𝑦 ∈ dom 𝑥 ↔ ∃𝑧𝑦, 𝑧⟩ ∈ 𝑥)
65anbi2i 726 . . . . . . 7 ((𝑥𝐴𝑦 ∈ dom 𝑥) ↔ (𝑥𝐴 ∧ ∃𝑧𝑦, 𝑧⟩ ∈ 𝑥))
72, 3, 63bitr4i 291 . . . . . 6 (∃𝑧(⟨𝑦, 𝑧⟩ ∈ 𝑥𝑥𝐴) ↔ (𝑥𝐴𝑦 ∈ dom 𝑥))
87exbii 1764 . . . . 5 (∃𝑥𝑧(⟨𝑦, 𝑧⟩ ∈ 𝑥𝑥𝐴) ↔ ∃𝑥(𝑥𝐴𝑦 ∈ dom 𝑥))
91, 8bitri 263 . . . 4 (∃𝑧𝑥(⟨𝑦, 𝑧⟩ ∈ 𝑥𝑥𝐴) ↔ ∃𝑥(𝑥𝐴𝑦 ∈ dom 𝑥))
10 eluni 4375 . . . . 5 (⟨𝑦, 𝑧⟩ ∈ 𝐴 ↔ ∃𝑥(⟨𝑦, 𝑧⟩ ∈ 𝑥𝑥𝐴))
1110exbii 1764 . . . 4 (∃𝑧𝑦, 𝑧⟩ ∈ 𝐴 ↔ ∃𝑧𝑥(⟨𝑦, 𝑧⟩ ∈ 𝑥𝑥𝐴))
12 df-rex 2902 . . . 4 (∃𝑥𝐴 𝑦 ∈ dom 𝑥 ↔ ∃𝑥(𝑥𝐴𝑦 ∈ dom 𝑥))
139, 11, 123bitr4i 291 . . 3 (∃𝑧𝑦, 𝑧⟩ ∈ 𝐴 ↔ ∃𝑥𝐴 𝑦 ∈ dom 𝑥)
144eldm2 5244 . . 3 (𝑦 ∈ dom 𝐴 ↔ ∃𝑧𝑦, 𝑧⟩ ∈ 𝐴)
15 eliun 4460 . . 3 (𝑦 𝑥𝐴 dom 𝑥 ↔ ∃𝑥𝐴 𝑦 ∈ dom 𝑥)
1613, 14, 153bitr4i 291 . 2 (𝑦 ∈ dom 𝐴𝑦 𝑥𝐴 dom 𝑥)
1716eqriv 2607 1 dom 𝐴 = 𝑥𝐴 dom 𝑥
Colors of variables: wff setvar class
Syntax hints:  wa 383   = wceq 1475  wex 1695  wcel 1977  wrex 2897  cop 4131   cuni 4372   ciun 4455  dom cdm 5038
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-dm 5048
This theorem is referenced by:  wfrdmss  7308  wfrdmcl  7310  tfrlem8  7367  axdc3lem2  9156  bnj1400  30160  frrlem5d  31031  frrlem5e  31032  frrlem7  31034  nofulllem5  31105
  Copyright terms: Public domain W3C validator