| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > uniun | Structured version Visualization version GIF version | ||
| Description: The class union of the union of two classes. Theorem 8.3 of [Quine] p. 53. (Contributed by NM, 20-Aug-1993.) |
| Ref | Expression |
|---|---|
| uniun | ⊢ ∪ (𝐴 ∪ 𝐵) = (∪ 𝐴 ∪ ∪ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 19.43 1882 | . . . 4 ⊢ (∃𝑦((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) ∨ (𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐵)) ↔ (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) ∨ ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐵))) | |
| 2 | elun 4128 | . . . . . . 7 ⊢ (𝑦 ∈ (𝐴 ∪ 𝐵) ↔ (𝑦 ∈ 𝐴 ∨ 𝑦 ∈ 𝐵)) | |
| 3 | 2 | anbi2i 623 | . . . . . 6 ⊢ ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ (𝐴 ∪ 𝐵)) ↔ (𝑥 ∈ 𝑦 ∧ (𝑦 ∈ 𝐴 ∨ 𝑦 ∈ 𝐵))) |
| 4 | andi 1009 | . . . . . 6 ⊢ ((𝑥 ∈ 𝑦 ∧ (𝑦 ∈ 𝐴 ∨ 𝑦 ∈ 𝐵)) ↔ ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) ∨ (𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐵))) | |
| 5 | 3, 4 | bitri 275 | . . . . 5 ⊢ ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ (𝐴 ∪ 𝐵)) ↔ ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) ∨ (𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐵))) |
| 6 | 5 | exbii 1848 | . . . 4 ⊢ (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ (𝐴 ∪ 𝐵)) ↔ ∃𝑦((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) ∨ (𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐵))) |
| 7 | eluni 4886 | . . . . 5 ⊢ (𝑥 ∈ ∪ 𝐴 ↔ ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴)) | |
| 8 | eluni 4886 | . . . . 5 ⊢ (𝑥 ∈ ∪ 𝐵 ↔ ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐵)) | |
| 9 | 7, 8 | orbi12i 914 | . . . 4 ⊢ ((𝑥 ∈ ∪ 𝐴 ∨ 𝑥 ∈ ∪ 𝐵) ↔ (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) ∨ ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐵))) |
| 10 | 1, 6, 9 | 3bitr4i 303 | . . 3 ⊢ (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ (𝐴 ∪ 𝐵)) ↔ (𝑥 ∈ ∪ 𝐴 ∨ 𝑥 ∈ ∪ 𝐵)) |
| 11 | eluni 4886 | . . 3 ⊢ (𝑥 ∈ ∪ (𝐴 ∪ 𝐵) ↔ ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ (𝐴 ∪ 𝐵))) | |
| 12 | elun 4128 | . . 3 ⊢ (𝑥 ∈ (∪ 𝐴 ∪ ∪ 𝐵) ↔ (𝑥 ∈ ∪ 𝐴 ∨ 𝑥 ∈ ∪ 𝐵)) | |
| 13 | 10, 11, 12 | 3bitr4i 303 | . 2 ⊢ (𝑥 ∈ ∪ (𝐴 ∪ 𝐵) ↔ 𝑥 ∈ (∪ 𝐴 ∪ ∪ 𝐵)) |
| 14 | 13 | eqriv 2732 | 1 ⊢ ∪ (𝐴 ∪ 𝐵) = (∪ 𝐴 ∪ ∪ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ wa 395 ∨ wo 847 = wceq 1540 ∃wex 1779 ∈ wcel 2108 ∪ cun 3924 ∪ cuni 4883 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2707 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1543 df-ex 1780 df-sb 2065 df-clab 2714 df-cleq 2727 df-clel 2809 df-v 3461 df-un 3931 df-uni 4884 |
| This theorem is referenced by: unidif0 5330 unisucs 6431 fvssunirnOLD 6910 fvun 6969 onuninsuci 7835 tc2 9756 fin1a2lem10 10423 fin1a2lem12 10425 incexclem 15852 dprd2da 20025 dmdprdsplit2lem 20028 ordtuni 23128 cmpcld 23340 uncmp 23341 refun0 23453 lfinun 23463 1stckgenlem 23491 filconn 23821 ufildr 23869 alexsubALTlem3 23987 cldsubg 24049 icccmplem2 24763 uniioombllem3 25538 madeoldsuc 27848 zs12bday 28395 sxbrsigalem0 34303 fiunelcarsg 34348 carsgclctunlem1 34349 carsggect 34350 cvmscld 35295 refssfne 36376 topjoin 36383 pibt2 37435 mbfresfi 37690 onsucunitp 43397 oaun3 43406 fourierdlem80 46215 isomenndlem 46559 |
| Copyright terms: Public domain | W3C validator |