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

Theorem ordgt0ge1 4128
Description: Two ways to express that an ordinal class is positive.
Assertion
Ref Expression
ordgt0ge1 |- (Ord A -> ((/) e. A <-> 1o (_ A))

Proof of Theorem ordgt0ge1
StepHypRef Expression
1 0elon 3012 . . 3 |- (/) e. On
2 ordelsuc 3061 . . 3 |- (((/) e. On /\ Ord A) -> ((/) e. A <-> suc (/) (_ A))
31, 2mpan 693 . 2 |- (Ord A -> ((/) e. A <-> suc (/) (_ A))
4 df-1o 4117 . . 3 |- 1o = suc (/)
54sseq1i 2075 . 2 |- (1o (_ A <-> suc (/) (_ A)
63, 5syl6bbr 536 1 |- (Ord A -> ((/) e. A <-> 1o (_ A))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146   e. wcel 955   (_ wss 2037  (/)c0 2270  Ord word 2937  Oncon0 2938  suc csuc 2940  1oc1o 4112
This theorem is referenced by:  ordge1n0 4129  oe0m1 4144  omword1 4188  omword2 4189  omlimcl 4193  oen0 4197  oewordi 4202
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 959  ax-gen 960  ax-8 961  ax-10 963  ax-11 964  ax-12 965  ax-13 966  ax-14 967  ax-17 968  ax-4 970  ax-5o 972  ax-6o 975  ax-9o 1119  ax-10o 1136  ax-16 1206  ax-11o 1213  ax-ext 1452  ax-sep 2693  ax-nul 2700  ax-pow 2732  ax-pr 2769  ax-un 2857
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3or 774  df-3an 775  df-ex 978  df-sb 1168  df-eu 1375  df-mo 1376  df-clab 1457  df-cleq 1462  df-clel 1465  df-ne 1579  df-ral 1641  df-rex 1642  df-v 1803  df-dif 2039  df-un 2040  df-in 2041  df-ss 2043  df-nul 2271  df-pw 2392  df-sn 2402  df-pr 2403  df-tp 2405  df-op 2406  df-uni 2494  df-br 2610  df-opab 2657  df-tr 2671  df-eprel 2821  df-po 2831  df-so 2841  df-fr 2907  df-we 2924  df-ord 2941  df-on 2942  df-suc 2944  df-1o 4117
Copyright terms: Public domain