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

Theorem 0ss 3535
Description: The null set is a subset of any class. Part of Exercise 1 of [TakeutiZaring] p. 22. (Contributed by NM, 5-Aug-1993.)
Assertion
Ref Expression
0ss  |-  (/)  C_  A

Proof of Theorem 0ss
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 noel 3500 . . 3  |-  -.  x  e.  (/)
21pm2.21i 651 . 2  |-  ( x  e.  (/)  ->  x  e.  A )
32ssriv 3232 1  |-  (/)  C_  A
Colors of variables: wff set class
Syntax hints:    e. wcel 2202    C_ wss 3201   (/)c0 3496
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-v 2805  df-dif 3203  df-in 3207  df-ss 3214  df-nul 3497
This theorem is referenced by:  ss0b  3536  ssdifeq0  3579  sssnr  3841  ssprr  3844  uni0  3925  int0el  3963  0disj  4090  disjx0  4092  tr0  4203  0elpw  4260  exmidsssn  4298  fr0  4454  elomssom  4709  rel0  4858  0ima  5103  fun0  5395  f0  5536  el2oss1o  6654  oaword1  6682  0domg  7066  nnnninf  7385  exmidfodomrlemim  7472  pw1on  7504  fzowrddc  11294  swrd00g  11296  swrdlend  11305  sum0  12029  prod0  12226  0bits  12600  ennnfonelemj0  13102  ennnfonelemkh  13113  lsp0  14519  lss0v  14526  0opn  14817  baspartn  14861  0cld  14923  ntr0  14945  egrsubgr  16204  0grsubgr  16205  0uhgrsubgr  16206  bdeq0  16583  bj-omtrans  16672  nninfsellemsuc  16738  nnnninfex  16748
  Copyright terms: Public domain W3C validator