MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ord0 Structured version   Visualization version   GIF version

Theorem ord0 6375
Description: The empty set is an ordinal class. Remark 1.5 of [Schloeder] p. 1. (Contributed by NM, 11-May-1994.)
Assertion
Ref Expression
ord0 Ord ∅

Proof of Theorem ord0
StepHypRef Expression
1 tr0 5240 . 2 Tr ∅
2 we0 5633 . 2 E We ∅
3 df-ord 6325 . 2 (Ord ∅ ↔ (Tr ∅ ∧ E We ∅))
41, 2, 3mpbir2an 709 1 Ord ∅
Colors of variables: wff setvar class
Syntax hints:  c0 4287  Tr wtr 5227   E cep 5541   We wwe 5592  Ord word 6321
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2702
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-sb 2068  df-clab 2709  df-cleq 2723  df-clel 2809  df-ne 2940  df-ral 3061  df-rex 3070  df-rab 3406  df-v 3448  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4288  df-if 4492  df-pw 4567  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4871  df-br 5111  df-tr 5228  df-po 5550  df-so 5551  df-fr 5593  df-we 5595  df-ord 6325
This theorem is referenced by:  0elon  6376  ord0eln0  6377  ordzsl  7786  smo0  8309  oicl  9474  alephgeom  10027
  Copyright terms: Public domain W3C validator