![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > ss0 | Unicode version |
Description: Any subset of the empty set is empty. Theorem 5 of [Suppes] p. 23. (Contributed by NM, 13-Aug-1994.) |
Ref | Expression |
---|---|
ss0 |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ss0b 3462 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
2 | 1 | biimpi 120 |
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-in1 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-ext 2159 |
This theorem depends on definitions: df-bi 117 df-tru 1356 df-nf 1461 df-sb 1763 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-v 2739 df-dif 3131 df-in 3135 df-ss 3142 df-nul 3423 |
This theorem is referenced by: sseq0 3464 abf 3466 eq0rdv 3467 ssdisj 3479 0dif 3494 poirr2 5018 iotanul 5190 f00 5404 map0b 6682 phplem2 6848 php5dom 6858 sbthlem7 6957 fi0 6969 casefun 7079 caseinj 7083 djufun 7098 djuinj 7100 nnnninfeq 7121 exmidomni 7135 ixxdisj 9897 icodisj 9986 ioodisj 9987 uzdisj 10086 nn0disj 10131 fsum2dlemstep 11433 fprodssdc 11589 fprod2dlemstep 11621 ntrcls0 13413 |
Copyright terms: Public domain | W3C validator |