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

Theorem ordelsuc 7185
 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 7183 . . 3 (Ord 𝐵 → (𝐴𝐵 → suc 𝐴𝐵))
21adantl 473 . 2 ((𝐴𝐶 ∧ Ord 𝐵) → (𝐴𝐵 → suc 𝐴𝐵))
3 sucssel 5980 . . 3 (𝐴𝐶 → (suc 𝐴𝐵𝐴𝐵))
43adantr 472 . 2 ((𝐴𝐶 ∧ Ord 𝐵) → (suc 𝐴𝐵𝐴𝐵))
52, 4impbid 202 1 ((𝐴𝐶 ∧ Ord 𝐵) → (𝐴𝐵 ↔ suc 𝐴𝐵))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 383   ∈ wcel 2139   ⊆ wss 3715  Ord word 5883  suc csuc 5886 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-8 2141  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740  ax-sep 4933  ax-nul 4941  ax-pr 5055  ax-un 7114 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1073  df-3an 1074  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-eu 2611  df-mo 2612  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ne 2933  df-ral 3055  df-rex 3056  df-rab 3059  df-v 3342  df-sbc 3577  df-dif 3718  df-un 3720  df-in 3722  df-ss 3729  df-pss 3731  df-nul 4059  df-if 4231  df-sn 4322  df-pr 4324  df-tp 4326  df-op 4328  df-uni 4589  df-br 4805  df-opab 4865  df-tr 4905  df-eprel 5179  df-po 5187  df-so 5188  df-fr 5225  df-we 5227  df-ord 5887  df-on 5888  df-suc 5890 This theorem is referenced by:  onsucmin  7186  onsucssi  7206  tfindsg2  7226  ordgt0ge1  7746  onomeneq  8315  cantnflem1  8759  r1ordg  8814  r1val1  8822  rankonidlem  8864  rankxplim3  8917
 Copyright terms: Public domain W3C validator