Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  0pss Unicode version

Theorem 0pss 3265
 Description: The null set is a proper subset of any non-empty set. (Contributed by NM, 27-Feb-1996.)
Assertion
Ref Expression
0pss

Proof of Theorem 0pss
StepHypRef Expression
1 0ss 3255 . . 3
2 df-pss 2933 . . 3
31, 2mpbiran 847 . 2
4 necom 2289 . 2
53, 4bitri 173 1
 Colors of variables: wff set class Syntax hints:   wb 98   wne 2204   wss 2917   wpss 2918  c0 3224 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-in1 544  ax-in2 545  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-ne 2206  df-v 2559  df-dif 2920  df-in 2924  df-ss 2931  df-pss 2933  df-nul 3225 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator