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

Theorem dmun 5865
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 5088 . . . . 5 (𝑦 = 𝑧 → (𝑦𝐴𝑥𝑧𝐴𝑥))
21exbidv 1923 . . . 4 (𝑦 = 𝑧 → (∃𝑥 𝑦𝐴𝑥 ↔ ∃𝑥 𝑧𝐴𝑥))
3 breq1 5088 . . . . 5 (𝑦 = 𝑧 → (𝑦𝐵𝑥𝑧𝐵𝑥))
43exbidv 1923 . . . 4 (𝑦 = 𝑧 → (∃𝑥 𝑦𝐵𝑥 ↔ ∃𝑥 𝑧𝐵𝑥))
52, 4unabw 4247 . . 3 ({𝑦 ∣ ∃𝑥 𝑦𝐴𝑥} ∪ {𝑦 ∣ ∃𝑥 𝑦𝐵𝑥}) = {𝑧 ∣ (∃𝑥 𝑧𝐴𝑥 ∨ ∃𝑥 𝑧𝐵𝑥)}
6 brun 5136 . . . . . 6 (𝑧(𝐴𝐵)𝑥 ↔ (𝑧𝐴𝑥𝑧𝐵𝑥))
76exbii 1850 . . . . 5 (∃𝑥 𝑧(𝐴𝐵)𝑥 ↔ ∃𝑥(𝑧𝐴𝑥𝑧𝐵𝑥))
8 19.43 1884 . . . . 5 (∃𝑥(𝑧𝐴𝑥𝑧𝐵𝑥) ↔ (∃𝑥 𝑧𝐴𝑥 ∨ ∃𝑥 𝑧𝐵𝑥))
97, 8bitr2i 276 . . . 4 ((∃𝑥 𝑧𝐴𝑥 ∨ ∃𝑥 𝑧𝐵𝑥) ↔ ∃𝑥 𝑧(𝐴𝐵)𝑥)
109abbii 2803 . . 3 {𝑧 ∣ (∃𝑥 𝑧𝐴𝑥 ∨ ∃𝑥 𝑧𝐵𝑥)} = {𝑧 ∣ ∃𝑥 𝑧(𝐴𝐵)𝑥}
115, 10eqtri 2759 . 2 ({𝑦 ∣ ∃𝑥 𝑦𝐴𝑥} ∪ {𝑦 ∣ ∃𝑥 𝑦𝐵𝑥}) = {𝑧 ∣ ∃𝑥 𝑧(𝐴𝐵)𝑥}
12 df-dm 5641 . . 3 dom 𝐴 = {𝑦 ∣ ∃𝑥 𝑦𝐴𝑥}
13 df-dm 5641 . . 3 dom 𝐵 = {𝑦 ∣ ∃𝑥 𝑦𝐵𝑥}
1412, 13uneq12i 4106 . 2 (dom 𝐴 ∪ dom 𝐵) = ({𝑦 ∣ ∃𝑥 𝑦𝐴𝑥} ∪ {𝑦 ∣ ∃𝑥 𝑦𝐵𝑥})
15 df-dm 5641 . 2 dom (𝐴𝐵) = {𝑧 ∣ ∃𝑥 𝑧(𝐴𝐵)𝑥}
1611, 14, 153eqtr4ri 2770 1 dom (𝐴𝐵) = (dom 𝐴 ∪ dom 𝐵)
Colors of variables: wff setvar class
Syntax hints:  wo 848   = wceq 1542  wex 1781  {cab 2714  cun 3887   class class class wbr 5085  dom cdm 5631
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2708
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2715  df-cleq 2728  df-clel 2811  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-br 5086  df-dm 5641
This theorem is referenced by:  rnun  6109  dmpropg  6179  dmtpop  6182  fntpg  6558  fnun  6612  frrlem14  8249  tfrlem10  8326  sbthlem5  9029  fodomr  9066  fodomfir  9238  axdc3lem4  10375  hashfun  14399  s4dom  14881  dmtrclfv  14980  strleun  17127  setsdm  17140  estrreslem2  18104  mvdco  19420  gsumzaddlem  19896  cnfldfunALT  21367  noextend  27630  noextendseq  27631  nosupbday  27669  nosupbnd1  27678  nosupbnd2  27680  noinfbday  27684  noinfbnd1  27693  noinfbnd2  27695  noetasuplem4  27700  noetainflem4  27704  uhgrun  29143  upgrun  29187  umgrun  29189  vtxdun  29550  wlkp1  29748  eupthp1  30286  bnj1416  35181  fineqvac  35260  satfdm  35551  fmlasuc0  35566  fixun  36089  dmuncnvepres  38712  dfsucmap3  38784  rclexi  44042  rtrclex  44044  rtrclexi  44048  cnvrcl0  44052  dmtrcl  44054  dfrtrcl5  44056  dfrcl2  44101  dmtrclfvRP  44157
  Copyright terms: Public domain W3C validator