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

Theorem onsucssi 4430
Description: A set belongs to an ordinal number iff its successor is a subset of the ordinal number. Exercise 8 of [TakeutiZaring] p. 42 and its converse. (Contributed by NM, 16-Sep-1995.)
Hypotheses
Ref Expression
onsucssi.1  |-  A  e.  On
onsucssi.2  |-  B  e.  On
Assertion
Ref Expression
onsucssi  |-  ( A  e.  B  <->  suc  A  C_  B )

Proof of Theorem onsucssi
StepHypRef Expression
1 onsucssi.1 . 2  |-  A  e.  On
2 onsucssi.2 . . 3  |-  B  e.  On
32onordi 4356 . 2  |-  Ord  B
4 ordelsuc 4429 . 2  |-  ( ( A  e.  On  /\  Ord  B )  ->  ( A  e.  B  <->  suc  A  C_  B ) )
51, 3, 4mp2an 423 1  |-  ( A  e.  B  <->  suc  A  C_  B )
Colors of variables: wff set class
Syntax hints:    <-> wb 104    e. wcel 1481    C_ wss 3076   Ord word 4292   Oncon0 4293   suc csuc 4295
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122
This theorem depends on definitions:  df-bi 116  df-tru 1335  df-nf 1438  df-sb 1737  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423  df-v 2691  df-un 3080  df-in 3082  df-ss 3089  df-sn 3538  df-uni 3745  df-tr 4035  df-iord 4296  df-on 4298  df-suc 4301
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator