ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  ordelsuc Unicode version

Theorem ordelsuc 4603
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  |-  ( ( A  e.  C  /\  Ord  B )  ->  ( A  e.  B  <->  suc  A  C_  B ) )

Proof of Theorem ordelsuc
StepHypRef Expression
1 ordsucss 4602 . . 3  |-  ( Ord 
B  ->  ( A  e.  B  ->  suc  A  C_  B ) )
21adantl 277 . 2  |-  ( ( A  e.  C  /\  Ord  B )  ->  ( A  e.  B  ->  suc 
A  C_  B )
)
3 sucssel 4521 . . 3  |-  ( A  e.  C  ->  ( suc  A  C_  B  ->  A  e.  B ) )
43adantr 276 . 2  |-  ( ( A  e.  C  /\  Ord  B )  ->  ( suc  A  C_  B  ->  A  e.  B ) )
52, 4impbid 129 1  |-  ( ( A  e.  C  /\  Ord  B )  ->  ( A  e.  B  <->  suc  A  C_  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    e. wcel 2202    C_ wss 3200   Ord word 4459   suc csuc 4462
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-v 2804  df-un 3204  df-in 3206  df-ss 3213  df-sn 3675  df-uni 3894  df-tr 4188  df-iord 4463  df-suc 4468
This theorem is referenced by:  onsucssi  4604  onsucmin  4605  onsucelsucr  4606  onsucsssucr  4607  onsucsssucexmid  4625  frecsuclem  6571  ordgt0ge1  6602  nnsucsssuc  6659  ennnfonelemk  13020  nninfsellemeq  16616
  Copyright terms: Public domain W3C validator