| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ssiun | Unicode version | ||
| Description: Subset implication for an indexed union. (Contributed by NM, 3-Sep-2003.) (Proof shortened by Andrew Salmon, 25-Jul-2011.) |
| Ref | Expression |
|---|---|
| ssiun |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssel 2939 |
. . . . 5
| |
| 2 | 1 | reximi 2416 |
. . . 4
|
| 3 | r19.37av 2463 |
. . . 4
| |
| 4 | 2, 3 | syl 14 |
. . 3
|
| 5 | eliun 3661 |
. . 3
| |
| 6 | 4, 5 | syl6ibr 151 |
. 2
|
| 7 | 6 | ssrdv 2951 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 |
| This theorem depends on definitions: df-bi 110 df-tru 1246 df-nf 1350 df-sb 1646 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-ral 2311 df-rex 2312 df-v 2559 df-in 2924 df-ss 2931 df-iun 3659 |
| This theorem is referenced by: iunss2 3702 iunpwss 3743 iunpw 4211 |
| Copyright terms: Public domain | W3C validator |