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

Theorem ordsucim 4536
Description: The successor of an ordinal class is ordinal. (Contributed by Jim Kingdon, 8-Nov-2018.)
Assertion
Ref Expression
ordsucim  |-  ( Ord 
A  ->  Ord  suc  A
)

Proof of Theorem ordsucim
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 ordtr 4413 . . 3  |-  ( Ord 
A  ->  Tr  A
)
2 suctr 4456 . . 3  |-  ( Tr  A  ->  Tr  suc  A
)
31, 2syl 14 . 2  |-  ( Ord 
A  ->  Tr  suc  A
)
4 df-suc 4406 . . . . . 6  |-  suc  A  =  ( A  u.  { A } )
54eleq2i 2263 . . . . 5  |-  ( x  e.  suc  A  <->  x  e.  ( A  u.  { A } ) )
6 elun 3304 . . . . 5  |-  ( x  e.  ( A  u.  { A } )  <->  ( x  e.  A  \/  x  e.  { A } ) )
7 velsn 3639 . . . . . 6  |-  ( x  e.  { A }  <->  x  =  A )
87orbi2i 763 . . . . 5  |-  ( ( x  e.  A  \/  x  e.  { A } )  <->  ( x  e.  A  \/  x  =  A ) )
95, 6, 83bitri 206 . . . 4  |-  ( x  e.  suc  A  <->  ( x  e.  A  \/  x  =  A ) )
10 dford3 4402 . . . . . . . 8  |-  ( Ord 
A  <->  ( Tr  A  /\  A. x  e.  A  Tr  x ) )
1110simprbi 275 . . . . . . 7  |-  ( Ord 
A  ->  A. x  e.  A  Tr  x
)
12 df-ral 2480 . . . . . . 7  |-  ( A. x  e.  A  Tr  x 
<-> 
A. x ( x  e.  A  ->  Tr  x ) )
1311, 12sylib 122 . . . . . 6  |-  ( Ord 
A  ->  A. x
( x  e.  A  ->  Tr  x ) )
141319.21bi 1572 . . . . 5  |-  ( Ord 
A  ->  ( x  e.  A  ->  Tr  x
) )
15 treq 4137 . . . . . 6  |-  ( x  =  A  ->  ( Tr  x  <->  Tr  A )
)
161, 15syl5ibrcom 157 . . . . 5  |-  ( Ord 
A  ->  ( x  =  A  ->  Tr  x
) )
1714, 16jaod 718 . . . 4  |-  ( Ord 
A  ->  ( (
x  e.  A  \/  x  =  A )  ->  Tr  x ) )
189, 17biimtrid 152 . . 3  |-  ( Ord 
A  ->  ( x  e.  suc  A  ->  Tr  x ) )
1918ralrimiv 2569 . 2  |-  ( Ord 
A  ->  A. x  e.  suc  A Tr  x
)
20 dford3 4402 . 2  |-  ( Ord 
suc  A  <->  ( Tr  suc  A  /\  A. x  e. 
suc  A Tr  x
) )
213, 19, 20sylanbrc 417 1  |-  ( Ord 
A  ->  Ord  suc  A
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    \/ wo 709   A.wal 1362    = wceq 1364    e. wcel 2167   A.wral 2475    u. cun 3155   {csn 3622   Tr wtr 4131   Ord word 4397   suc csuc 4400
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-ext 2178
This theorem depends on definitions:  df-bi 117  df-tru 1367  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-v 2765  df-un 3161  df-in 3163  df-ss 3170  df-sn 3628  df-uni 3840  df-tr 4132  df-iord 4401  df-suc 4406
This theorem is referenced by:  onsuc  4537  ordsucg  4538  onsucsssucr  4545  ordtriexmidlem  4555  2ordpr  4560  ordsuc  4599  nnsucsssuc  6550
  Copyright terms: Public domain W3C validator