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

Theorem ordelsuc 7753
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 7751 . . 3 (Ord 𝐵 → (𝐴𝐵 → suc 𝐴𝐵))
21adantl 481 . 2 ((𝐴𝐶 ∧ Ord 𝐵) → (𝐴𝐵 → suc 𝐴𝐵))
3 sucssel 6404 . . 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 2109  wss 3903  Ord word 6306  suc csuc 6309
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2701  ax-sep 5235  ax-nul 5245  ax-pr 5371
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3395  df-v 3438  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4859  df-br 5093  df-opab 5155  df-tr 5200  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-we 5574  df-ord 6310  df-on 6311  df-suc 6313
This theorem is referenced by:  onsucmin  7754  onsucssi  7774  tfindsg2  7795  ordgt0ge1  8411  cantnflem1  9585  ttrcltr  9612  dmttrcl  9617  r1ordg  9674  r1val1  9682  rankonidlem  9724  rankxplim3  9777  bdayle  27830  ordeldifsucon  43232  ordeldif1o  43233  oaltom  43378  omltoe  43380
  Copyright terms: Public domain W3C validator