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

Theorem dmun 5898
Description: The domain of a union is the union of domains. Exercise 56(a) of [Enderton] p. 65. (Contributed by NM, 12-Aug-1994.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
Assertion
Ref Expression
dmun dom (𝐴𝐵) = (dom 𝐴 ∪ dom 𝐵)

Proof of Theorem dmun
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 breq1 5110 . . . . 5 (𝑦 = 𝑧 → (𝑦𝐴𝑥𝑧𝐴𝑥))
21exbidv 1954 . . . 4 (𝑦 = 𝑧 → (∃𝑥 𝑦𝐴𝑥 ↔ ∃𝑥 𝑧𝐴𝑥))
3 breq1 5110 . . . . 5 (𝑦 = 𝑧 → (𝑦𝐵𝑥𝑧𝐵𝑥))
43exbidv 1954 . . . 4 (𝑦 = 𝑧 → (∃𝑥 𝑦𝐵𝑥 ↔ ∃𝑥 𝑧𝐵𝑥))
52, 4unabw 4256 . . 3 ({𝑦 ∣ ∃𝑥 𝑦𝐴𝑥} ∪ {𝑦 ∣ ∃𝑥 𝑦𝐵𝑥}) = {𝑧 ∣ (∃𝑥 𝑧𝐴𝑥 ∨ ∃𝑥 𝑧𝐵𝑥)}
6 brun 5160 . . . . . 6 (𝑧(𝐴𝐵)𝑥 ↔ (𝑧𝐴𝑥𝑧𝐵𝑥))
76exbii 1881 . . . . 5 (∃𝑥 𝑧(𝐴𝐵)𝑥 ↔ ∃𝑥(𝑧𝐴𝑥𝑧𝐵𝑥))
8 19.43 1915 . . . . 5 (∃𝑥(𝑧𝐴𝑥𝑧𝐵𝑥) ↔ (∃𝑥 𝑧𝐴𝑥 ∨ ∃𝑥 𝑧𝐵𝑥))
97, 8bitr2i 279 . . . 4 ((∃𝑥 𝑧𝐴𝑥 ∨ ∃𝑥 𝑧𝐵𝑥) ↔ ∃𝑥 𝑧(𝐴𝐵)𝑥)
109abbii 2829 . . 3 {𝑧 ∣ (∃𝑥 𝑧𝐴𝑥 ∨ ∃𝑥 𝑧𝐵𝑥)} = {𝑧 ∣ ∃𝑥 𝑧(𝐴𝐵)𝑥}
115, 10eqtri 2785 . 2 ({𝑦 ∣ ∃𝑥 𝑦𝐴𝑥} ∪ {𝑦 ∣ ∃𝑥 𝑦𝐵𝑥}) = {𝑧 ∣ ∃𝑥 𝑧(𝐴𝐵)𝑥}
12 df-dm 5669 . . 3 dom 𝐴 = {𝑦 ∣ ∃𝑥 𝑦𝐴𝑥}
13 df-dm 5669 . . 3 dom 𝐵 = {𝑦 ∣ ∃𝑥 𝑦𝐵𝑥}
1412, 13uneq12i 4116 . 2 (dom 𝐴 ∪ dom 𝐵) = ({𝑦 ∣ ∃𝑥 𝑦𝐴𝑥} ∪ {𝑦 ∣ ∃𝑥 𝑦𝐵𝑥})
15 df-dm 5669 . 2 dom (𝐴𝐵) = {𝑧 ∣ ∃𝑥 𝑧(𝐴𝐵)𝑥}
1611, 14, 153eqtr4ri 2796 1 dom (𝐴𝐵) = (dom 𝐴 ∪ dom 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wo 861   = wceq 1570  wex 1812  {cab 2740  cun 3900   class class class wbr 5107  dom cdm 5659
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-8 2147  ax-9 2155  ax-ext 2734
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-br 5108  df-dm 5669
This theorem is used by:  rnun  6140  dmpropg  6215  dmtpop  6218  fntpg  6597  fnun  6650  frrlem14  8302  tfrlem10  8380  sbthlem5  9093  fodomr  9130  fodomfir  9301  axdc3lem4  10459  hashfun  14506  s4dom  14994  dmtrclfv  15095  strleun  17255  setsdm  17268  estrreslem2  18232  mvdco  19578  gsumzaddlem  20054  cnfldfunALT  21606  noextend  27910  noextendseq  27911  nosupbday  27949  nosupbnd1  27958  nosupbnd2  27960  noinfbday  27964  noinfbnd1  27973  noinfbnd2  27975  noetasuplem4  27980  noetainflem4  27984  uhgrun  29539  upgrun  29583  umgrun  29585  vtxdun  29949  wlkp1  30147  eupthp1  30704  bnj1416  35556  fineqvac  35650  satfdm  35956  fmlasuc0  35971  fixun  36494  dmuncnvepres  39147  dfsucmap3  39219  rclexi  44463  rtrclex  44465  rtrclexi  44469  cnvrcl0  44473  dmtrcl  44475  dfrtrcl5  44477  dfrcl2  44522  dmtrclfvRP  44578
  Copyright terms: Public domain W3C validator