Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > iunss | Structured version Visualization version Unicode version |
Description: Subset theorem for an indexed union. (Contributed by NM, 13-Sep-2003.) (Proof shortened by Andrew Salmon, 25-Jul-2011.) |
Ref | Expression |
---|---|
iunss |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-iun 4522 | . . 3 | |
2 | 1 | sseq1i 3629 | . 2 |
3 | abss 3671 | . 2 | |
4 | dfss2 3591 | . . . 4 | |
5 | 4 | ralbii 2980 | . . 3 |
6 | ralcom4 3224 | . . 3 | |
7 | r19.23v 3023 | . . . 4 | |
8 | 7 | albii 1747 | . . 3 |
9 | 5, 6, 8 | 3bitrri 287 | . 2 |
10 | 2, 3, 9 | 3bitri 286 | 1 |
Copyright terms: Public domain | W3C validator |