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

Theorem ord0 6379
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 5219 . 2 Tr ∅
2 we0 5627 . 2 E We ∅
3 df-ord 6328 . 2 (Ord ∅ ↔ (Tr ∅ ∧ E We ∅))
41, 2, 3mpbir2an 712 1 Ord ∅
Colors of variables: wff setvar class
Syntax hints:  c0 4287  Tr wtr 5207   E cep 5531   We wwe 5584  Ord word 6324
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-tr 5208  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-ord 6328
This theorem is referenced by:  0elon  6380  ord0eln0  6381  ordzsl  7797  smo0  8300  oicl  9446  alephgeom  10004  bdaypw2n0bndlem  28471
  Copyright terms: Public domain W3C validator