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

Theorem 0ss 3531
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 3496 . . 3  |-  -.  x  e.  (/)
21pm2.21i 649 . 2  |-  ( x  e.  (/)  ->  x  e.  A )
32ssriv 3229 1  |-  (/)  C_  A
Colors of variables: wff set class
Syntax hints:    e. wcel 2200    C_ 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:  ss0b  3532  ssdifeq0  3575  sssnr  3834  ssprr  3837  uni0  3918  int0el  3956  0disj  4083  disjx0  4085  tr0  4196  0elpw  4252  exmidsssn  4290  fr0  4446  elomssom  4701  rel0  4850  0ima  5094  fun0  5385  f0  5524  el2oss1o  6606  oaword1  6634  0domg  7018  nnnninf  7316  exmidfodomrlemim  7402  pw1on  7434  fzowrddc  11218  swrd00g  11220  swrdlend  11229  sum0  11939  prod0  12136  0bits  12510  ennnfonelemj0  13012  ennnfonelemkh  13023  lsp0  14427  lss0v  14434  0opn  14720  baspartn  14764  0cld  14826  ntr0  14848  bdeq0  16398  bj-omtrans  16487  nninfsellemsuc  16550  nnnninfex  16560
  Copyright terms: Public domain W3C validator