ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  dmun GIF version

Theorem dmun 4631
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 unab 3264 . . 3 ({𝑦 ∣ ∃𝑥 𝑦𝐴𝑥} ∪ {𝑦 ∣ ∃𝑥 𝑦𝐵𝑥}) = {𝑦 ∣ (∃𝑥 𝑦𝐴𝑥 ∨ ∃𝑥 𝑦𝐵𝑥)}
2 brun 3883 . . . . . 6 (𝑦(𝐴𝐵)𝑥 ↔ (𝑦𝐴𝑥𝑦𝐵𝑥))
32exbii 1541 . . . . 5 (∃𝑥 𝑦(𝐴𝐵)𝑥 ↔ ∃𝑥(𝑦𝐴𝑥𝑦𝐵𝑥))
4 19.43 1564 . . . . 5 (∃𝑥(𝑦𝐴𝑥𝑦𝐵𝑥) ↔ (∃𝑥 𝑦𝐴𝑥 ∨ ∃𝑥 𝑦𝐵𝑥))
53, 4bitr2i 183 . . . 4 ((∃𝑥 𝑦𝐴𝑥 ∨ ∃𝑥 𝑦𝐵𝑥) ↔ ∃𝑥 𝑦(𝐴𝐵)𝑥)
65abbii 2203 . . 3 {𝑦 ∣ (∃𝑥 𝑦𝐴𝑥 ∨ ∃𝑥 𝑦𝐵𝑥)} = {𝑦 ∣ ∃𝑥 𝑦(𝐴𝐵)𝑥}
71, 6eqtri 2108 . 2 ({𝑦 ∣ ∃𝑥 𝑦𝐴𝑥} ∪ {𝑦 ∣ ∃𝑥 𝑦𝐵𝑥}) = {𝑦 ∣ ∃𝑥 𝑦(𝐴𝐵)𝑥}
8 df-dm 4438 . . 3 dom 𝐴 = {𝑦 ∣ ∃𝑥 𝑦𝐴𝑥}
9 df-dm 4438 . . 3 dom 𝐵 = {𝑦 ∣ ∃𝑥 𝑦𝐵𝑥}
108, 9uneq12i 3150 . 2 (dom 𝐴 ∪ dom 𝐵) = ({𝑦 ∣ ∃𝑥 𝑦𝐴𝑥} ∪ {𝑦 ∣ ∃𝑥 𝑦𝐵𝑥})
11 df-dm 4438 . 2 dom (𝐴𝐵) = {𝑦 ∣ ∃𝑥 𝑦(𝐴𝐵)𝑥}
127, 10, 113eqtr4ri 2119 1 dom (𝐴𝐵) = (dom 𝐴 ∪ dom 𝐵)
Colors of variables: wff set class
Syntax hints:  wo 664   = wceq 1289  wex 1426  {cab 2074  cun 2995   class class class wbr 3837  dom cdm 4428
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 665  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-8 1440  ax-10 1441  ax-11 1442  ax-i12 1443  ax-bndl 1444  ax-4 1445  ax-17 1464  ax-i9 1468  ax-ial 1472  ax-i5r 1473  ax-ext 2070
This theorem depends on definitions:  df-bi 115  df-tru 1292  df-nf 1395  df-sb 1693  df-clab 2075  df-cleq 2081  df-clel 2084  df-nfc 2217  df-v 2621  df-un 3001  df-br 3838  df-dm 4438
This theorem is referenced by:  rnun  4827  dmpropg  4890  dmtpop  4893  fntpg  5056  fnun  5106  sbthlemi5  6649  casedm  6756  djudm  6764  exmidfodomrlemim  6806
  Copyright terms: Public domain W3C validator