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

Theorem ordsucim 4627
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 4504 . . 3  |-  ( Ord 
A  ->  Tr  A
)
2 suctr 4547 . . 3  |-  ( Tr  A  ->  Tr  suc  A
)
31, 2syl 14 . 2  |-  ( Ord 
A  ->  Tr  suc  A
)
4 df-suc 4497 . . . . . 6  |-  suc  A  =  ( A  u.  { A } )
54eleq2i 2301 . . . . 5  |-  ( x  e.  suc  A  <->  x  e.  ( A  u.  { A } ) )
6 elun 3364 . . . . 5  |-  ( x  e.  ( A  u.  { A } )  <->  ( x  e.  A  \/  x  e.  { A } ) )
7 velsn 3711 . . . . . 6  |-  ( x  e.  { A }  <->  x  =  A )
87orbi2i 770 . . . . 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 4493 . . . . . . . 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 2527 . . . . . . 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 1607 . . . . 5  |-  ( Ord 
A  ->  ( x  e.  A  ->  Tr  x
) )
15 treq 4219 . . . . . 6  |-  ( x  =  A  ->  ( Tr  x  <->  Tr  A )
)
161, 15syl5ibrcom 157 . . . . 5  |-  ( Ord 
A  ->  ( x  =  A  ->  Tr  x
) )
1714, 16jaod 725 . . . 4  |-  ( Ord 
A  ->  ( (
x  e.  A  \/  x  =  A )  ->  Tr  x ) )
189, 17biimtrid 152 . . 3  |-  ( Ord 
A  ->  ( x  e.  suc  A  ->  Tr  x ) )
1918ralrimiv 2616 . 2  |-  ( Ord 
A  ->  A. x  e.  suc  A Tr  x
)
20 dford3 4493 . 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 716   A.wal 1396    = wceq 1398    e. wcel 2205   A.wral 2522    u. cun 3212   {csn 3694   Tr wtr 4213   Ord word 4488   suc csuc 4491
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2216
This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-v 2817  df-un 3218  df-in 3220  df-ss 3227  df-sn 3700  df-uni 3920  df-tr 4214  df-iord 4492  df-suc 4497
This theorem is referenced by:  onsuc  4628  ordsucg  4629  onsucsssucr  4636  ordtriexmidlem  4646  2ordpr  4651  ordsuc  4690  nnsucsssuc  6738
  Copyright terms: Public domain W3C validator