| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > iunss1 | Unicode version | ||
| Description: Subclass theorem for indexed union. (Contributed by NM, 10-Dec-2004.) (Proof shortened by Andrew Salmon, 25-Jul-2011.) |
| Ref | Expression |
|---|---|
| iunss1 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssrexv 3293 |
. . 3
| |
| 2 | eliun 3979 |
. . 3
| |
| 3 | eliun 3979 |
. . 3
| |
| 4 | 1, 2, 3 | 3imtr4g 205 |
. 2
|
| 5 | 4 | ssrdv 3234 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-tru 1401 df-nf 1510 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ral 2516 df-rex 2517 df-v 2805 df-in 3207 df-ss 3214 df-iun 3977 |
| This theorem is referenced by: iuneq1 3988 iunxdif2 4024 fsumiun 12118 |
| Copyright terms: Public domain | W3C validator |