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

Theorem onpsssuc 7019
Description: An ordinal number is a proper subset of its successor. (Contributed by Stefan O'Rear, 18-Nov-2014.)
Assertion
Ref Expression
onpsssuc  |-  ( A  e.  On  ->  A  C. 
suc  A )

Proof of Theorem onpsssuc
StepHypRef Expression
1 sucidg 5803 . 2  |-  ( A  e.  On  ->  A  e.  suc  A )
2 eloni 5733 . . 3  |-  ( A  e.  On  ->  Ord  A )
3 ordsuc 7014 . . . 4  |-  ( Ord 
A  <->  Ord  suc  A )
42, 3sylib 208 . . 3  |-  ( A  e.  On  ->  Ord  suc 
A )
5 ordelpss 5751 . . 3  |-  ( ( Ord  A  /\  Ord  suc 
A )  ->  ( A  e.  suc  A  <->  A  C.  suc  A
) )
62, 4, 5syl2anc 693 . 2  |-  ( A  e.  On  ->  ( A  e.  suc  A  <->  A  C.  suc  A
) )
71, 6mpbid 222 1  |-  ( A  e.  On  ->  A  C. 
suc  A )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 196    e. wcel 1990    C. wpss 3575   Ord word 5722   Oncon0 5723   suc csuc 5725
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-tr 4753  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-ord 5726  df-on 5727  df-suc 5729
This theorem is referenced by:  ackbij1lem15  9056
  Copyright terms: Public domain W3C validator