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

Theorem ord0 6415
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 5231 . 2 Tr ∅
2 we0 5656 . 2 E We ∅
3 df-ord 6363 . 2 (Ord ∅ ↔ (Tr ∅ ∧ E We ∅))
41, 2, 3mpbir2an 723 1 Ord ∅
Colors of variables: wff setvar class
Syntax hints:  c0 4286  Tr wtr 5218   E cep 5560   We wwe 5613  Ord word 6359
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-tr 5219  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-ord 6363
This theorem is referenced by:  0elon  6416  ord0eln0  6417  ordzsl  7837  smo0  8341  oicl  9487  alephgeom  10062  bdaypw2n0bndlem  28656
  Copyright terms: Public domain W3C validator