Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  onsucssi Structured version   Unicode version

Theorem onsucssi 4823
 Description: A set belongs to an ordinal number iff its successor is a subset of the ordinal number. Exercise 8 of [TakeutiZaring] p. 42 and its converse. (Contributed by NM, 16-Sep-1995.)
Hypotheses
Ref Expression
onssi.1
onsucssi.2
Assertion
Ref Expression
onsucssi

Proof of Theorem onsucssi
StepHypRef Expression
1 onssi.1 . 2
2 onsucssi.2 . . 3
32onordi 4688 . 2
4 ordelsuc 4802 . 2
51, 3, 4mp2an 655 1
 Colors of variables: wff set class Syntax hints:   wb 178   wcel 1726   wss 3322   word 4582  con0 4583   csuc 4585 This theorem is referenced by:  omopthlem1  6900  rankval4  7795  rankc1  7798  rankc2  7799  rankxplim  7805  rankxplim3  7807  onsucsuccmpi  26195 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1556  ax-5 1567  ax-17 1627  ax-9 1667  ax-8 1688  ax-13 1728  ax-14 1730  ax-6 1745  ax-7 1750  ax-11 1762  ax-12 1951  ax-ext 2419  ax-sep 4332  ax-nul 4340  ax-pr 4405  ax-un 4703 This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3or 938  df-3an 939  df-tru 1329  df-ex 1552  df-nf 1555  df-sb 1660  df-eu 2287  df-mo 2288  df-clab 2425  df-cleq 2431  df-clel 2434  df-nfc 2563  df-ne 2603  df-ral 2712  df-rex 2713  df-rab 2716  df-v 2960  df-sbc 3164  df-dif 3325  df-un 3327  df-in 3329  df-ss 3336  df-pss 3338  df-nul 3631  df-if 3742  df-sn 3822  df-pr 3823  df-tp 3824  df-op 3825  df-uni 4018  df-br 4215  df-opab 4269  df-tr 4305  df-eprel 4496  df-po 4505  df-so 4506  df-fr 4543  df-we 4545  df-ord 4586  df-on 4587  df-suc 4589
 Copyright terms: Public domain W3C validator