| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > coundi | Structured version Visualization version GIF version | ||
| Description: Class composition distributes over union. (Contributed by NM, 21-Dec-2008.) (Proof shortened by Andrew Salmon, 27-Aug-2011.) |
| Ref | Expression |
|---|---|
| coundi | ⊢ (𝐴 ∘ (𝐵 ∪ 𝐶)) = ((𝐴 ∘ 𝐵) ∪ (𝐴 ∘ 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | unopab 5185 | . . 3 ⊢ ({〈𝑥, 𝑦〉 ∣ ∃𝑧(𝑥𝐵𝑧 ∧ 𝑧𝐴𝑦)} ∪ {〈𝑥, 𝑦〉 ∣ ∃𝑧(𝑥𝐶𝑧 ∧ 𝑧𝐴𝑦)}) = {〈𝑥, 𝑦〉 ∣ (∃𝑧(𝑥𝐵𝑧 ∧ 𝑧𝐴𝑦) ∨ ∃𝑧(𝑥𝐶𝑧 ∧ 𝑧𝐴𝑦))} | |
| 2 | brun 5156 | . . . . . . . 8 ⊢ (𝑥(𝐵 ∪ 𝐶)𝑧 ↔ (𝑥𝐵𝑧 ∨ 𝑥𝐶𝑧)) | |
| 3 | 2 | anbi1i 636 | . . . . . . 7 ⊢ ((𝑥(𝐵 ∪ 𝐶)𝑧 ∧ 𝑧𝐴𝑦) ↔ ((𝑥𝐵𝑧 ∨ 𝑥𝐶𝑧) ∧ 𝑧𝐴𝑦)) |
| 4 | andir 1026 | . . . . . . 7 ⊢ (((𝑥𝐵𝑧 ∨ 𝑥𝐶𝑧) ∧ 𝑧𝐴𝑦) ↔ ((𝑥𝐵𝑧 ∧ 𝑧𝐴𝑦) ∨ (𝑥𝐶𝑧 ∧ 𝑧𝐴𝑦))) | |
| 5 | 3, 4 | bitri 278 | . . . . . 6 ⊢ ((𝑥(𝐵 ∪ 𝐶)𝑧 ∧ 𝑧𝐴𝑦) ↔ ((𝑥𝐵𝑧 ∧ 𝑧𝐴𝑦) ∨ (𝑥𝐶𝑧 ∧ 𝑧𝐴𝑦))) |
| 6 | 5 | exbii 1881 | . . . . 5 ⊢ (∃𝑧(𝑥(𝐵 ∪ 𝐶)𝑧 ∧ 𝑧𝐴𝑦) ↔ ∃𝑧((𝑥𝐵𝑧 ∧ 𝑧𝐴𝑦) ∨ (𝑥𝐶𝑧 ∧ 𝑧𝐴𝑦))) |
| 7 | 19.43 1915 | . . . . 5 ⊢ (∃𝑧((𝑥𝐵𝑧 ∧ 𝑧𝐴𝑦) ∨ (𝑥𝐶𝑧 ∧ 𝑧𝐴𝑦)) ↔ (∃𝑧(𝑥𝐵𝑧 ∧ 𝑧𝐴𝑦) ∨ ∃𝑧(𝑥𝐶𝑧 ∧ 𝑧𝐴𝑦))) | |
| 8 | 6, 7 | bitr2i 279 | . . . 4 ⊢ ((∃𝑧(𝑥𝐵𝑧 ∧ 𝑧𝐴𝑦) ∨ ∃𝑧(𝑥𝐶𝑧 ∧ 𝑧𝐴𝑦)) ↔ ∃𝑧(𝑥(𝐵 ∪ 𝐶)𝑧 ∧ 𝑧𝐴𝑦)) |
| 9 | 8 | opabbii 5172 | . . 3 ⊢ {〈𝑥, 𝑦〉 ∣ (∃𝑧(𝑥𝐵𝑧 ∧ 𝑧𝐴𝑦) ∨ ∃𝑧(𝑥𝐶𝑧 ∧ 𝑧𝐴𝑦))} = {〈𝑥, 𝑦〉 ∣ ∃𝑧(𝑥(𝐵 ∪ 𝐶)𝑧 ∧ 𝑧𝐴𝑦)} |
| 10 | 1, 9 | eqtri 2784 | . 2 ⊢ ({〈𝑥, 𝑦〉 ∣ ∃𝑧(𝑥𝐵𝑧 ∧ 𝑧𝐴𝑦)} ∪ {〈𝑥, 𝑦〉 ∣ ∃𝑧(𝑥𝐶𝑧 ∧ 𝑧𝐴𝑦)}) = {〈𝑥, 𝑦〉 ∣ ∃𝑧(𝑥(𝐵 ∪ 𝐶)𝑧 ∧ 𝑧𝐴𝑦)} |
| 11 | df-co 5660 | . . 3 ⊢ (𝐴 ∘ 𝐵) = {〈𝑥, 𝑦〉 ∣ ∃𝑧(𝑥𝐵𝑧 ∧ 𝑧𝐴𝑦)} | |
| 12 | df-co 5660 | . . 3 ⊢ (𝐴 ∘ 𝐶) = {〈𝑥, 𝑦〉 ∣ ∃𝑧(𝑥𝐶𝑧 ∧ 𝑧𝐴𝑦)} | |
| 13 | 11, 12 | uneq12i 4113 | . 2 ⊢ ((𝐴 ∘ 𝐵) ∪ (𝐴 ∘ 𝐶)) = ({〈𝑥, 𝑦〉 ∣ ∃𝑧(𝑥𝐵𝑧 ∧ 𝑧𝐴𝑦)} ∪ {〈𝑥, 𝑦〉 ∣ ∃𝑧(𝑥𝐶𝑧 ∧ 𝑧𝐴𝑦)}) |
| 14 | df-co 5660 | . 2 ⊢ (𝐴 ∘ (𝐵 ∪ 𝐶)) = {〈𝑥, 𝑦〉 ∣ ∃𝑧(𝑥(𝐵 ∪ 𝐶)𝑧 ∧ 𝑧𝐴𝑦)} | |
| 15 | 10, 13, 14 | 3eqtr4ri 2795 | 1 ⊢ (𝐴 ∘ (𝐵 ∪ 𝐶)) = ((𝐴 ∘ 𝐵) ∪ (𝐴 ∘ 𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∧ wa 401 ∨ wo 861 = wceq 1570 ∃wex 1812 ∪ cun 3897 class class class wbr 5103 {copab 5167 ∘ ccom 5655 |
| 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 2733 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2740 df-cleq 2753 df-clel 2836 df-v 3453 df-un 3904 df-br 5104 df-opab 5168 df-co 5660 |
| This theorem is used by: f1ofvswap 7306 mvdco 19639 ustssco 24514 coprprop 33274 cycpmconjv 33685 cvmliftlem10 36028 poimirlem9 38515 diophren 43773 rtrclex 44576 trclubgNEW 44577 trclexi 44579 rtrclexi 44580 cnvtrcl0 44585 trrelsuperrel2dg 44630 cotrclrcl 44701 frege131d 44723 dftpos6 49927 |
| Copyright terms: Public domain | W3C validator |