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

Theorem 0ss 3547
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 3512 . . 3  |-  -.  x  e.  (/)
21pm2.21i 651 . 2  |-  ( x  e.  (/)  ->  x  e.  A )
32ssriv 3242 1  |-  (/)  C_  A
Colors of variables: wff set class
Syntax hints:    e. wcel 2203    C_ wss 3211   (/)c0 3508
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 2214
This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-v 2815  df-dif 3213  df-in 3217  df-ss 3224  df-nul 3509
This theorem is referenced by:  ss0b  3548  ssdifeq0  3592  sssnr  3857  ssprr  3860  uni0  3941  int0el  3979  0disj  4106  disjx0  4108  tr0  4219  0elpw  4277  exmidsssn  4315  fr0  4472  elomssom  4727  rel0  4877  0ima  5122  fun0  5414  f0  5558  el2oss1o  6676  oaword1  6704  0domg  7090  nnnninf  7417  exmidfodomrlemim  7504  pw1on  7536  fzowrddc  11339  swrd00g  11341  swrdlend  11350  sum0  12074  prod0  12271  0bits  12645  ennnfonelemj0  13152  ennnfonelemkh  13163  lsp0  14571  lss0v  14578  0opn  14871  baspartn  14915  0cld  14977  ntr0  14999  egrsubgr  16258  0grsubgr  16259  0uhgrsubgr  16260  bdeq0  16637  bj-omtrans  16726  nninfsellemsuc  16790  nnnninfex  16800
  Copyright terms: Public domain W3C validator