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

Theorem nlimsucg 4550
Description: A successor is not a limit ordinal. (Contributed by NM, 25-Mar-1995.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
Assertion
Ref Expression
nlimsucg  |-  ( A  e.  V  ->  -.  Lim  suc  A )

Proof of Theorem nlimsucg
StepHypRef Expression
1 limord 4380 . . . . . 6  |-  ( Lim 
suc  A  ->  Ord  suc  A )
2 ordsuc 4547 . . . . . 6  |-  ( Ord 
A  <->  Ord  suc  A )
31, 2sylibr 133 . . . . 5  |-  ( Lim 
suc  A  ->  Ord  A
)
4 limuni 4381 . . . . 5  |-  ( Lim 
suc  A  ->  suc  A  =  U. suc  A )
53, 4jca 304 . . . 4  |-  ( Lim 
suc  A  ->  ( Ord 
A  /\  suc  A  = 
U. suc  A )
)
6 ordtr 4363 . . . . . . . 8  |-  ( Ord 
A  ->  Tr  A
)
7 unisucg 4399 . . . . . . . . 9  |-  ( A  e.  V  ->  ( Tr  A  <->  U. suc  A  =  A ) )
87biimpa 294 . . . . . . . 8  |-  ( ( A  e.  V  /\  Tr  A )  ->  U. suc  A  =  A )
96, 8sylan2 284 . . . . . . 7  |-  ( ( A  e.  V  /\  Ord  A )  ->  U. suc  A  =  A )
109eqeq2d 2182 . . . . . 6  |-  ( ( A  e.  V  /\  Ord  A )  ->  ( suc  A  =  U. suc  A  <->  suc  A  =  A ) )
11 ordirr 4526 . . . . . . . . 9  |-  ( Ord 
A  ->  -.  A  e.  A )
12 eleq2 2234 . . . . . . . . . 10  |-  ( suc 
A  =  A  -> 
( A  e.  suc  A  <-> 
A  e.  A ) )
1312notbid 662 . . . . . . . . 9  |-  ( suc 
A  =  A  -> 
( -.  A  e. 
suc  A  <->  -.  A  e.  A ) )
1411, 13syl5ibrcom 156 . . . . . . . 8  |-  ( Ord 
A  ->  ( suc  A  =  A  ->  -.  A  e.  suc  A ) )
15 sucidg 4401 . . . . . . . . 9  |-  ( A  e.  V  ->  A  e.  suc  A )
1615con3i 627 . . . . . . . 8  |-  ( -.  A  e.  suc  A  ->  -.  A  e.  V
)
1714, 16syl6 33 . . . . . . 7  |-  ( Ord 
A  ->  ( suc  A  =  A  ->  -.  A  e.  V )
)
1817adantl 275 . . . . . 6  |-  ( ( A  e.  V  /\  Ord  A )  ->  ( suc  A  =  A  ->  -.  A  e.  V
) )
1910, 18sylbid 149 . . . . 5  |-  ( ( A  e.  V  /\  Ord  A )  ->  ( suc  A  =  U. suc  A  ->  -.  A  e.  V ) )
2019expimpd 361 . . . 4  |-  ( A  e.  V  ->  (
( Ord  A  /\  suc  A  =  U. suc  A )  ->  -.  A  e.  V ) )
215, 20syl5 32 . . 3  |-  ( A  e.  V  ->  ( Lim  suc  A  ->  -.  A  e.  V )
)
2221con2d 619 . 2  |-  ( A  e.  V  ->  ( A  e.  V  ->  -. 
Lim  suc  A ) )
2322pm2.43i 49 1  |-  ( A  e.  V  ->  -.  Lim  suc  A )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 103    = wceq 1348    e. wcel 2141   U.cuni 3796   Tr wtr 4087   Ord word 4347   Lim wlim 4349   suc csuc 4350
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152  ax-setind 4521
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-ral 2453  df-rex 2454  df-v 2732  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-sn 3589  df-pr 3590  df-uni 3797  df-tr 4088  df-iord 4351  df-ilim 4354  df-suc 4356
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator