| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Subset theorem for an indexed union. |
| Ref | Expression |
|---|---|
| iunss |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfss2 2055 |
. . . 4
| |
| 2 | 1 | ralbii 1665 |
. . 3
|
| 3 | df-ral 1647 |
. . 3
| |
| 4 | impexp 347 |
. . . . . 6
| |
| 5 | 4 | albii 998 |
. . . . 5
|
| 6 | 19.21v 1284 |
. . . . 5
| |
| 7 | 5, 6 | bitr2 174 |
. . . 4
|
| 8 | 7 | albii 998 |
. . 3
|
| 9 | 2, 3, 8 | 3bitr 177 |
. 2
|
| 10 | 19.23v 1292 |
. . . . 5
| |
| 11 | eliun 2566 |
. . . . . . 7
| |
| 12 | df-rex 1648 |
. . . . . . 7
| |
| 13 | 11, 12 | bitr 173 |
. . . . . 6
|
| 14 | 13 | imbi1i 186 |
. . . . 5
|
| 15 | 10, 14 | bitr4 176 |
. . . 4
|
| 16 | 15 | albii 998 |
. . 3
|
| 17 | alcom 1031 |
. . 3
| |
| 18 | dfss2 2055 |
. . 3
| |
| 19 | 16, 17, 18 | 3bitr4 183 |
. 2
|
| 20 | 9, 19 | bitr2 174 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: iunss2 2591 oawordeulem 4181 oaabslem 4244 trcl 4628 r1val1 4641 rankuni2 4673 rankval4 4685 rankbnd 4686 rankbnd2 4687 rankc1 4688 iincld 7639 cncnplem4 7737 ubthlem5 8492 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 961 ax-gen 962 ax-8 963 ax-10 965 ax-12 967 ax-17 970 ax-4 972 ax-5o 974 ax-6o 977 ax-9o 1122 ax-10o 1139 ax-16 1209 ax-11o 1217 ax-ext 1458 |
| This theorem depends on definitions: df-bi 147 df-an 225 df-ex 980 df-sb 1171 df-clab 1463 df-cleq 1468 df-clel 1471 df-ral 1647 df-rex 1648 df-v 1809 df-in 2048 df-ss 2050 df-iun 2564 |