| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ss0 | GIF 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 3532 | . 2 ⊢ (𝐴 ⊆ ∅ ↔ 𝐴 = ∅) | |
| 2 | 1 | biimpi 120 | 1 ⊢ (𝐴 ⊆ ∅ → 𝐴 = ∅) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1395 ⊆ wss 3198 ∅c0 3492 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-ext 2211 |
| This theorem depends on definitions: df-bi 117 df-tru 1398 df-nf 1507 df-sb 1809 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-v 2802 df-dif 3200 df-in 3204 df-ss 3211 df-nul 3493 |
| This theorem is referenced by: sseq0 3534 abf 3536 eq0rdv 3537 ssdisj 3549 0dif 3564 poirr2 5127 iotanul 5300 f00 5525 map0b 6851 phplem2 7034 php5dom 7044 sbthlem7 7156 fi0 7168 casefun 7278 caseinj 7282 djufun 7297 djuinj 7299 nninfninc 7316 nnnninfeq 7321 exmidomni 7335 ixxdisj 10131 icodisj 10220 ioodisj 10221 uzdisj 10321 nn0disj 10366 swrd0g 11234 fsum2dlemstep 11988 fprodssdc 12144 fprod2dlemstep 12176 ntrcls0 14848 vtxdfifiun 16108 vtxdumgrfival 16109 |
| Copyright terms: Public domain | W3C validator |