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

Theorem 0lt1o 3116
Description: Ordinal zero is less than ordinal one.
Assertion
Ref Expression
0lt1o |- (/) e. 1o

Proof of Theorem 0lt1o
StepHypRef Expression
1 cleqid 1102 . 2 |- (/) = (/)
2 el1o 3115 . 2 |- ((/) e. 1o <-> (/) = (/))
31, 2mpbir 165 1 |- (/) e. 1o
Colors of variables: wff set class
Syntax hints:   = wceq 1091   e. wcel 1092  (/)c0 1707  1oc1o 3099
This theorem is referenced by:  oe1m 3147  oen0 3165
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-v 1349  df-dif 1489  df-un 1490  df-in 1491  df-nul 1708  df-sn 1811  df-pr 1812  df-suc 2205  df-1o 3104
metamath.org