| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: A relationship involving union and indexed union. Exercise 25 of [Enderton] p. 33. (The proof was shortened by Andrew Salmon, 25-Jul-2011.) |
| Ref | Expression |
|---|---|
| iununi |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ne 2019 |
. . . . . . . 8
| |
| 2 | r19.45zv 2966 |
. . . . . . . 8
| |
| 3 | 1, 2 | sylbir 218 |
. . . . . . 7
|
| 4 | n0i 2880 |
. . . . . . . . 9
| |
| 5 | 4 | con2i 113 |
. . . . . . . 8
|
| 6 | biorf 807 |
. . . . . . . . . 10
| |
| 7 | 6 | rexbidv 2124 |
. . . . . . . . 9
|
| 8 | biorf 807 |
. . . . . . . . 9
| |
| 9 | 7, 8 | bitr3d 589 |
. . . . . . . 8
|
| 10 | 5, 9 | syl 12 |
. . . . . . 7
|
| 11 | 3, 10 | ja 152 |
. . . . . 6
|
| 12 | 11 | bicomd 580 |
. . . . 5
|
| 13 | elun 2741 |
. . . . . 6
| |
| 14 | 13 | rexbii 2128 |
. . . . 5
|
| 15 | 12, 14 | syl6bbr 597 |
. . . 4
|
| 16 | elun 2741 |
. . . . 5
| |
| 17 | eluni2 3181 |
. . . . . 6
| |
| 18 | 17 | orbi2i 275 |
. . . . 5
|
| 19 | 16, 18 | bitri 190 |
. . . 4
|
| 20 | eliun 3259 |
. . . 4
| |
| 21 | 15, 19, 20 | 3bitr4g 614 |
. . 3
|
| 22 | 21 | eqrdv 1882 |
. 2
|
| 23 | eleq2 1958 |
. . . . . . . . 9
| |
| 24 | eluni 3180 |
. . . . . . . . . . 11
| |
| 25 | 24 | orbi2i 275 |
. . . . . . . . . 10
|
| 26 | ax-17 1317 |
. . . . . . . . . . 11
| |
| 27 | 26 | 19.45 1442 |
. . . . . . . . . 10
|
| 28 | 25, 16, 27 | 3bitr4i 200 |
. . . . . . . . 9
|
| 29 | df-rex 2110 |
. . . . . . . . . 10
| |
| 30 | 20, 29 | bitri 190 |
. . . . . . . . 9
|
| 31 | 23, 28, 30 | 3bitr3g 613 |
. . . . . . . 8
|
| 32 | 31 | biimpd 170 |
. . . . . . 7
|
| 33 | 19.39 1433 |
. . . . . . 7
| |
| 34 | orc 291 |
. . . . . . . . 9
| |
| 35 | simpl 346 |
. . . . . . . . 9
| |
| 36 | 34, 35 | imim12i 21 |
. . . . . . . 8
|
| 37 | 36 | eximi 1387 |
. . . . . . 7
|
| 38 | 32, 33, 37 | 3syl 24 |
. . . . . 6
|
| 39 | 19.37v 1683 |
. . . . . 6
| |
| 40 | 38, 39 | sylib 215 |
. . . . 5
|
| 41 | 40 | 19.23adv 1584 |
. . . 4
|
| 42 | neq0 2885 |
. . . 4
| |
| 43 | neq0 2885 |
. . . 4
| |
| 44 | 41, 42, 43 | 3imtr4g 612 |
. . 3
|
| 45 | 44 | con4d 91 |
. 2
|
| 46 | 22, 45 | impbii 174 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 1304 ax-gen 1305 ax-8 1306 ax-9 1307 ax-10 1308 ax-11 1309 ax-12 1310 ax-17 1317 ax-4 1319 ax-5o 1321 ax-6o 1324 ax-9o 1481 ax-10o 1500 ax-16 1580 ax-11o 1588 ax-ext 1865 |
| This theorem depends on definitions: df-bi 164 df-or 241 df-an 242 df-ex 1327 df-sb 1536 df-clab 1872 df-cleq 1877 df-clel 1880 df-ne 2019 df-ral 2109 df-rex 2110 df-v 2294 df-dif 2597 df-un 2600 df-nul 2876 df-uni 3178 df-iun 3257 |