Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > spcgft | Structured version Visualization version Unicode version |
Description: A closed version of spcgf 3288. (Contributed by Andrew Salmon, 6-Jun-2011.) (Revised by Mario Carneiro, 4-Jan-2017.) |
Ref | Expression |
---|---|
spcimgft.1 | |
spcimgft.2 |
Ref | Expression |
---|---|
spcgft |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | biimp 205 | . . . 4 | |
2 | 1 | imim2i 16 | . . 3 |
3 | 2 | alimi 1739 | . 2 |
4 | spcimgft.1 | . . 3 | |
5 | spcimgft.2 | . . 3 | |
6 | 4, 5 | spcimgft 3284 | . 2 |
7 | 3, 6 | syl 17 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wi 4 wb 196 wal 1481 wceq 1483 wnf 1708 wcel 1990 wnfc 2751 |
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: spcgf 3288 rspct 3302 |
Copyright terms: Public domain | W3C validator |