| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dmun | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| dmun | ⊢ dom (𝐴 ∪ 𝐵) = (dom 𝐴 ∪ dom 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | breq1 5102 | . . . . 5 ⊢ (𝑦 = 𝑧 → (𝑦𝐴𝑥 ↔ 𝑧𝐴𝑥)) | |
| 2 | 1 | exbidv 1940 | . . . 4 ⊢ (𝑦 = 𝑧 → (∃𝑥 𝑦𝐴𝑥 ↔ ∃𝑥 𝑧𝐴𝑥)) |
| 3 | breq1 5102 | . . . . 5 ⊢ (𝑦 = 𝑧 → (𝑦𝐵𝑥 ↔ 𝑧𝐵𝑥)) | |
| 4 | 3 | exbidv 1940 | . . . 4 ⊢ (𝑦 = 𝑧 → (∃𝑥 𝑦𝐵𝑥 ↔ ∃𝑥 𝑧𝐵𝑥)) |
| 5 | 2, 4 | unabw 4259 | . . 3 ⊢ ({𝑦 ∣ ∃𝑥 𝑦𝐴𝑥} ∪ {𝑦 ∣ ∃𝑥 𝑦𝐵𝑥}) = {𝑧 ∣ (∃𝑥 𝑧𝐴𝑥 ∨ ∃𝑥 𝑧𝐵𝑥)} |
| 6 | brun 5150 | . . . . . 6 ⊢ (𝑧(𝐴 ∪ 𝐵)𝑥 ↔ (𝑧𝐴𝑥 ∨ 𝑧𝐵𝑥)) | |
| 7 | 6 | exbii 1867 | . . . . 5 ⊢ (∃𝑥 𝑧(𝐴 ∪ 𝐵)𝑥 ↔ ∃𝑥(𝑧𝐴𝑥 ∨ 𝑧𝐵𝑥)) |
| 8 | 19.43 1901 | . . . . 5 ⊢ (∃𝑥(𝑧𝐴𝑥 ∨ 𝑧𝐵𝑥) ↔ (∃𝑥 𝑧𝐴𝑥 ∨ ∃𝑥 𝑧𝐵𝑥)) | |
| 9 | 7, 8 | bitr2i 278 | . . . 4 ⊢ ((∃𝑥 𝑧𝐴𝑥 ∨ ∃𝑥 𝑧𝐵𝑥) ↔ ∃𝑥 𝑧(𝐴 ∪ 𝐵)𝑥) |
| 10 | 9 | abbii 2828 | . . 3 ⊢ {𝑧 ∣ (∃𝑥 𝑧𝐴𝑥 ∨ ∃𝑥 𝑧𝐵𝑥)} = {𝑧 ∣ ∃𝑥 𝑧(𝐴 ∪ 𝐵)𝑥} |
| 11 | 5, 10 | eqtri 2784 | . 2 ⊢ ({𝑦 ∣ ∃𝑥 𝑦𝐴𝑥} ∪ {𝑦 ∣ ∃𝑥 𝑦𝐵𝑥}) = {𝑧 ∣ ∃𝑥 𝑧(𝐴 ∪ 𝐵)𝑥} |
| 12 | df-dm 5655 | . . 3 ⊢ dom 𝐴 = {𝑦 ∣ ∃𝑥 𝑦𝐴𝑥} | |
| 13 | df-dm 5655 | . . 3 ⊢ dom 𝐵 = {𝑦 ∣ ∃𝑥 𝑦𝐵𝑥} | |
| 14 | 12, 13 | uneq12i 4119 | . 2 ⊢ (dom 𝐴 ∪ dom 𝐵) = ({𝑦 ∣ ∃𝑥 𝑦𝐴𝑥} ∪ {𝑦 ∣ ∃𝑥 𝑦𝐵𝑥}) |
| 15 | df-dm 5655 | . 2 ⊢ dom (𝐴 ∪ 𝐵) = {𝑧 ∣ ∃𝑥 𝑧(𝐴 ∪ 𝐵)𝑥} | |
| 16 | 11, 14, 15 | 3eqtr4ri 2795 | 1 ⊢ dom (𝐴 ∪ 𝐵) = (dom 𝐴 ∪ dom 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: ∨ wo 858 = wceq 1559 ∃wex 1798 {cab 2739 ∪ cun 3902 class class class wbr 5099 dom cdm 5645 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-ext 2733 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-rab 3414 df-v 3455 df-dif 3907 df-un 3909 df-ss 3921 df-nul 4286 df-if 4480 df-sn 4582 df-pr 4584 df-op 4588 df-br 5100 df-dm 5655 |
| This theorem is referenced by: rnun 6126 dmpropg 6198 dmtpop 6201 fntpg 6577 fnun 6631 frrlem14 8275 tfrlem10 8353 sbthlem5 9059 fodomr 9096 fodomfir 9268 axdc3lem4 10407 hashfun 14447 s4dom 14929 dmtrclfv 15028 strleun 17176 setsdm 17189 estrreslem2 18153 mvdco 19468 gsumzaddlem 19944 cnfldfunALT 21419 noextend 27707 noextendseq 27708 nosupbday 27746 nosupbnd1 27755 nosupbnd2 27757 noinfbday 27761 noinfbnd1 27770 noinfbnd2 27772 noetasuplem4 27777 noetainflem4 27781 uhgrun 29221 upgrun 29265 umgrun 29267 vtxdun 29628 wlkp1 29826 eupthp1 30364 bnj1416 35298 fineqvac 35376 satfdm 35683 fmlasuc0 35698 fixun 36221 dmuncnvepres 38854 dfsucmap3 38926 rclexi 44155 rtrclex 44157 rtrclexi 44161 cnvrcl0 44165 dmtrcl 44167 dfrtrcl5 44169 dfrcl2 44214 dmtrclfvRP 44270 |
| Copyright terms: Public domain | W3C validator |