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
This proof depends on syntax axioms:    e. wcel 2209    C_ wss 3220   (/)c0 3520
This proof depends on 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 proof 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 used by:  ss0b  3562  ssdifeq0  3610  sssnr  3878  ssprr  3881  uni0  3962  int0el  4000  0disj  4128  disjx0  4130  tr0  4242  0elpw  4303  exmidsssn  4341  fr0  4498  elomssom  4754  rel0  4904  0ima  5150  fun0  5442  f0  5586  el2oss1o  6720  oaword1  6748  0domg  7141  nnnninf  7472  exmidfodomrlemim  7559  pw1on  7591  indconst0  9311  fzowrddc  11441  swrd00g  11443  swrdlend  11452  sum0  12180  prod0  12377  0bits  12751  ennnfonelemj0  13350  ennnfonelemkh  13361  lsp0  14869  lss0v  14876  0opn  15232  baspartn  15276  0cld  15338  ntr0  15360  egrsubgr  16709  0grsubgr  16710  0uhgrsubgr  16711  bdeq0  17098  bj-omtrans  17187  nninfsellemsuc  17261  nnnninfex  17271
  Copyright terms: Public domain W3C validator