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

Theorem pp0ex 4321
Description:  { (/)
,  { (/) } } (the ordinal 2) is a set. (Contributed by NM, 5-Aug-1993.)
Assertion
Ref Expression
pp0ex  |-  { (/) ,  { (/) } }  e.  _V

Proof of Theorem pp0ex
StepHypRef Expression
1 p0ex 4320 . . 3  |-  { (/) }  e.  _V
21pwex 4315 . 2  |-  ~P { (/)
}  e.  _V
3 pwpw0ss 3925 . 2  |-  { (/) ,  { (/) } }  C_  ~P { (/) }
42, 3ssexi 4266 1  |-  { (/) ,  { (/) } }  e.  _V
Colors of variables: wff set class
Syntax hints:    e. wcel 2209   _Vcvv 2821   (/)c0 3520   ~Pcpw 3685   {csn 3705   {cpr 3706
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-14 2212  ax-ext 2220  ax-sep 4244  ax-nul 4254  ax-pow 4306
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-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712
This theorem is referenced by:  ord3ex  4322  ontr2exmid  4667  ordtri2or2exmidlem  4668  onsucelsucexmidlem  4671  regexmid  4677  reg2exmid  4678  reg3exmid  4722  nnregexmid  4763  acexmidlemcase  6070  acexmidlemv  6073  exmidpw2en  7209  exmidaclem  7554
  Copyright terms: Public domain W3C validator