HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem ord0 3021
Description: The empty set is an ordinal class.
Assertion
Ref Expression
ord0 |- Ord (/)

Proof of Theorem ord0
StepHypRef Expression
1 df-ord 2951 . 2 |- (Ord (/) <-> (Tr (/) /\ E We (/)))
2 tr0 2691 . 2 |- Tr (/)
3 we0 2944 . 2 |- E We (/)
41, 2, 3mpbir2an 730 1 |- Ord (/)
Colors of variables: wff set class
Syntax hints:  (/)c0 2280  Tr wtr 2680  Ecep 2830   We wwe 2916  Ord word 2947
This theorem is referenced by:  0elon 3022  ord0eln0 3023  ordzsl 3116  alephgeom 4882
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-12 968  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 981  df-sb 1172  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1587  df-ral 1649  df-rex 1650  df-v 1812  df-dif 2049  df-un 2050  df-in 2051  df-ss 2053  df-nul 2281  df-pw 2402  df-sn 2412  df-pr 2413  df-op 2416  df-uni 2504  df-br 2620  df-tr 2681  df-po 2840  df-so 2850  df-fr 2917  df-we 2934  df-ord 2951
Copyright terms: Public domain