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

Theorem ordelsuc 3061
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.
Assertion
Ref Expression
ordelsuc |- ((A e. C /\ Ord B) -> (A e. B <-> suc A (_ B))

Proof of Theorem ordelsuc
StepHypRef Expression
1 ordsucss 3059 . . 3 |- (Ord B -> (A e. B -> suc A (_ B))
21adantl 388 . 2 |- ((A e. C /\ Ord B) -> (A e. B -> suc A (_ B))
3 sucssel 3060 . . 3 |- (A e. C -> (suc A (_ B -> A e. B))
43adantr 389 . 2 |- ((A e. C /\ Ord B) -> (suc A (_ B -> A e. B))
52, 4impbid 514 1 |- ((A e. C /\ Ord B) -> (A e. B <-> suc A (_ B))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146   /\ wa 223   e. wcel 955   (_ wss 2037  Ord word 2937  suc csuc 2940
This theorem is referenced by:  onsucmin 3062  ordunel 3074  onsucss 3101  tfindsg2 3153  ordgt0ge1 4128  onomeneq 4498  omsucdom 4502  rankxplim3 4686
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-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
Copyright terms: Public domain