Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > spcimgft | Structured version Visualization version Unicode version |
Description: A closed version of spcimgf 3286. (Contributed by Mario Carneiro, 4-Jan-2017.) |
Ref | Expression |
---|---|
spcimgft.1 | |
spcimgft.2 |
Ref | Expression |
---|---|
spcimgft |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elex 3212 | . 2 | |
2 | spcimgft.2 | . . . . 5 | |
3 | 2 | issetf 3208 | . . . 4 |
4 | exim 1761 | . . . 4 | |
5 | 3, 4 | syl5bi 232 | . . 3 |
6 | spcimgft.1 | . . . 4 | |
7 | 6 | 19.36 2098 | . . 3 |
8 | 5, 7 | syl6ib 241 | . 2 |
9 | 1, 8 | syl5 34 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wi 4 wal 1481 wceq 1483 wex 1704 wnf 1708 wcel 1990 wnfc 2751 cvv 3200 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-v 3202 |
This theorem is referenced by: spcgft 3285 spcimgf 3286 spcimdv 3290 ss2iundf 37951 spcdvw 42426 |
Copyright terms: Public domain | W3C validator |