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

Theorem ordelsuc 7856
Description: A set belongs to an ordinal iff its successor is a subset of the ordinal. Exercise 8 of [TakeutiZaring] p. 42 and its converse. (Contributed by NM, 29-Nov-2003.)
Assertion
Ref Expression
ordelsuc ((𝐴𝐶 ∧ Ord 𝐵) → (𝐴𝐵 ↔ suc 𝐴𝐵))

Proof of Theorem ordelsuc
StepHypRef Expression
1 ordsucss 7854 . . 3 (Ord 𝐵 → (𝐴𝐵 → suc 𝐴𝐵))
21adantl 481 . 2 ((𝐴𝐶 ∧ Ord 𝐵) → (𝐴𝐵 → suc 𝐴𝐵))
3 sucssel 6490 . . 3 (𝐴𝐶 → (suc 𝐴𝐵𝐴𝐵))
43adantr 480 . 2 ((𝐴𝐶 ∧ Ord 𝐵) → (suc 𝐴𝐵𝐴𝐵))
52, 4impbid 212 1 ((𝐴𝐶 ∧ Ord 𝐵) → (𝐴𝐵 ↔ suc 𝐴𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  wcel 2108  wss 3976  Ord word 6394  suc csuc 6397
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-tr 5284  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-ord 6398  df-on 6399  df-suc 6401
This theorem is referenced by:  onsucmin  7857  onsucssi  7878  tfindsg2  7899  ordgt0ge1  8549  onomeneqOLD  9292  cantnflem1  9758  ttrcltr  9785  dmttrcl  9790  r1ordg  9847  r1val1  9855  rankonidlem  9897  rankxplim3  9950  ordeldifsucon  43221  ordeldif1o  43222  oaltom  43367  omltoe  43369
  Copyright terms: Public domain W3C validator