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

Theorem onpsssuc 4295
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 elirr 4266 . . . 4  |-  -.  A  e.  A
2 sucidg 4153 . . . . 5  |-  ( A  e.  On  ->  A  e.  suc  A )
3 eleq2 2101 . . . . 5  |-  ( A  =  suc  A  -> 
( A  e.  A  <->  A  e.  suc  A ) )
42, 3syl5ibrcom 146 . . . 4  |-  ( A  e.  On  ->  ( A  =  suc  A  ->  A  e.  A )
)
51, 4mtoi 590 . . 3  |-  ( A  e.  On  ->  -.  A  =  suc  A )
6 sssucid 4152 . . 3  |-  A  C_  suc  A
75, 6jctil 295 . 2  |-  ( A  e.  On  ->  ( A  C_  suc  A  /\  -.  A  =  suc  A ) )
8 dfpss2 3029 . 2  |-  ( A 
C.  suc  A  <->  ( A  C_ 
suc  A  /\  -.  A  =  suc  A ) )
97, 8sylibr 137 1  |-  ( A  e.  On  ->  A  C. 
suc  A )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 97    = wceq 1243    e. wcel 1393    C_ wss 2917    C. wpss 2918   Oncon0 4100   suc csuc 4102
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 544  ax-in2 545  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-setind 4262
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ne 2206  df-ral 2311  df-v 2559  df-dif 2920  df-un 2922  df-in 2924  df-ss 2931  df-pss 2933  df-sn 3381  df-suc 4108
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator