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

Theorem dmun 5891
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 5105 . . . . 5 (𝑦 = 𝑧 → (𝑦𝐴𝑥 ↔ 𝑧𝐴𝑥))
21exbidv 1953 . . . 4 (𝑦 = 𝑧 → (∃𝑥 𝑦𝐴𝑥 ↔ ∃𝑥 𝑧𝐴𝑥))
3 breq1 5105 . . . . 5 (𝑦 = 𝑧 → (𝑦𝐵𝑥 ↔ 𝑧𝐵𝑥))
43exbidv 1953 . . . 4 (𝑦 = 𝑧 → (∃𝑥 𝑦𝐵𝑥 ↔ ∃𝑥 𝑧𝐵𝑥))
52, 4unabw 4252 . . 3 ({𝑦 ∣ ∃𝑥 𝑦𝐴𝑥} ∪ {𝑦 ∣ ∃𝑥 𝑦𝐵𝑥}) = {𝑧 ∣ (∃𝑥 𝑧𝐴𝑥 ∨ ∃𝑥 𝑧𝐵𝑥)}
6 brun 5155 . . . . . 6 (𝑧(𝐴 ∪ 𝐵)𝑥 ↔ (𝑧𝐴𝑥 ∨ 𝑧𝐵𝑥))
76exbii 1880 . . . . 5 (∃𝑥 𝑧(𝐴 ∪ 𝐵)𝑥 ↔ ∃𝑥(𝑧𝐴𝑥 ∨ 𝑧𝐵𝑥))
8 19.43 1914 . . . . 5 (∃𝑥(𝑧𝐴𝑥 ∨ 𝑧𝐵𝑥) ↔ (∃𝑥 𝑧𝐴𝑥 ∨ ∃𝑥 𝑧𝐵𝑥))
97, 8bitr2i 279 . . . 4 ((∃𝑥 𝑧𝐴𝑥 ∨ ∃𝑥 𝑧𝐵𝑥) ↔ ∃𝑥 𝑧(𝐴 ∪ 𝐵)𝑥)
109abbii 2827 . . 3 {𝑧 ∣ (∃𝑥 𝑧𝐴𝑥 ∨ ∃𝑥 𝑧𝐵𝑥)} = {𝑧 ∣ ∃𝑥 𝑧(𝐴 ∪ 𝐵)𝑥}
115, 10eqtri 2783 . 2 ({𝑦 ∣ ∃𝑥 𝑦𝐴𝑥} ∪ {𝑦 ∣ ∃𝑥 𝑦𝐵𝑥}) = {𝑧 ∣ ∃𝑥 𝑧(𝐴 ∪ 𝐵)𝑥}
12 df-dm 5660 . . 3 dom 𝐴 = {𝑦 ∣ ∃𝑥 𝑦𝐴𝑥}
13 df-dm 5660 . . 3 dom 𝐵 = {𝑦 ∣ ∃𝑥 𝑦𝐵𝑥}
1412, 13uneq12i 4112 . 2 (dom 𝐴 ∪ dom 𝐵) = ({𝑦 ∣ ∃𝑥 𝑦𝐴𝑥} ∪ {𝑦 ∣ ∃𝑥 𝑦𝐵𝑥})
15 df-dm 5660 . 2 dom (𝐴 ∪ 𝐵) = {𝑧 ∣ ∃𝑥 𝑧(𝐴 ∪ 𝐵)𝑥}
1611, 14, 153eqtr4ri 2794 1 dom (𝐴 ∪ 𝐵) = (dom 𝐴 ∪ dom 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ∨ wo 861   = wceq 1569  ∃wex 1811  {cab 2738   ∪ cun 3896   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-8 2146  ax-9 2154  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-dif 3899  df-un 3901  df-ss 3914  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-br 5103  df-dm 5660
This theorem is used by:  rnun  6135  dmpropg  6216  dmtpop  6219  fntpg  6600  fnun  6653  frrlem14  8317  tfrlem10  8395  sbthlem5  9110  fodomr  9147  fodomfir  9319  axdc3lem4  10531  hashfun  14582  s4dom  15070  dmtrclfv  15171  strleun  17335  setsdm  17348  estrreslem2  18312  mvdco  19659  gsumzaddlem  20135  cnfldfunALT  21693  noextend  28023  noextendseq  28024  nosupbday  28062  nosupbnd1  28071  nosupbnd2  28073  noinfbday  28077  noinfbnd1  28086  noinfbnd2  28088  noetasuplem4  28093  noetainflem4  28097  uhgrun  29652  upgrun  29696  umgrun  29698  vtxdun  30062  wlkp1  30260  eupthp1  30817  bnj1416  35669  fineqvac  35784  satfdm  36134  fmlasuc0  36149  fixun  36671  dmuncnvepres  39324  dfsucmap3  39396  rclexi  44615  rtrclex  44617  rtrclexi  44621  cnvrcl0  44625  dmtrcl  44627  dfrtrcl5  44629  dfrcl2  44674  dmtrclfvRP  44730
  Copyright terms: Public domain W3C validator