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

Theorem onsucssi 4250
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 4181 . 2  |-  Ord  B
4 ordelsuc 4249 . 2  |-  ( ( A  e.  On  /\  Ord  B )  ->  ( A  e.  B  <->  suc  A  C_  B ) )
51, 3, 4mp2an 416 1  |-  ( A  e.  B  <->  suc  A  C_  B )
Colors of variables: wff set class
Syntax hints:    <-> wb 103    e. wcel 1433    C_ wss 2973   Ord word 4117   Oncon0 4118   suc csuc 4120
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063
This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-v 2603  df-un 2977  df-in 2979  df-ss 2986  df-sn 3404  df-uni 3602  df-tr 3876  df-iord 4121  df-on 4123  df-suc 4126
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator