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

Theorem 0ss 3561
Description: The empty set is a subset of any class. Dual of ssv 3270. 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 3525 . . 3  |-  -.  x  e.  (/)
21pm2.21i 655 . 2  |-  ( x  e.  (/)  ->  x  e.  A )
32ssriv 3252 1  |-  (/)  C_  A
Colors of variables: wff set class
Syntax hints:    e. wcel 2209    C_ wss 3220   (/)c0 3520
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This theorem depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-v 2823  df-dif 3222  df-in 3226  df-ss 3233  df-nul 3521
This theorem is referenced by:  ss0b  3562  ssdifeq0  3607  sssnr  3873  ssprr  3876  uni0  3957  int0el  3995  0disj  4122  disjx0  4124  tr0  4235  0elpw  4296  exmidsssn  4334  fr0  4491  elomssom  4747  rel0  4897  0ima  5142  fun0  5434  f0  5578  el2oss1o  6706  oaword1  6734  0domg  7127  nnnninf  7456  exmidfodomrlemim  7543  pw1on  7575  fzowrddc  11397  swrd00g  11399  swrdlend  11408  sum0  12133  prod0  12330  0bits  12704  ennnfonelemj0  13270  ennnfonelemkh  13281  lsp0  14732  lss0v  14739  0opn  15030  baspartn  15074  0cld  15136  ntr0  15158  egrsubgr  16418  0grsubgr  16419  0uhgrsubgr  16420  bdeq0  16807  bj-omtrans  16896  nninfsellemsuc  16960  nnnninfex  16970
  Copyright terms: Public domain W3C validator