Theorem nlimsucg 4567

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

Step	Hyp	Ref	Expression
1		limord 4397	. . . . . 6 |- ( Lim suc A -> Ord suc A )
2		ordsuc 4564	. . . . . 6 |- ( Ord A <-> Ord suc A )
3	1, 2	sylibr 134	. . . . 5 |- ( Lim suc A -> Ord A )
4		limuni 4398	. . . . 5 |- ( Lim suc A -> suc A = U. suc A )
5	3, 4	jca 306	. . . 4 |- ( Lim suc A -> ( Ord A /\ suc A = U. suc A ) )
6		ordtr 4380	. . . . . . . 8 |- ( Ord A -> Tr A )
7		unisucg 4416	. . . . . . . . 9 |- ( A e. V -> ( Tr A <-> U. suc A = A ) )
8	7	biimpa 296	. . . . . . . 8 |- ( ( A e. V /\ Tr A ) -> U. suc A = A )
9	6, 8	sylan2 286	. . . . . . 7 |- ( ( A e. V /\ Ord A ) -> U. suc A = A )
10	9	eqeq2d 2189	. . . . . 6 |- ( ( A e. V /\ Ord A ) -> ( suc A = U. suc A <-> suc A = A ) )
11		ordirr 4543	. . . . . . . . 9 |- ( Ord A -> -. A e. A )
12		eleq2 2241	. . . . . . . . . 10 |- ( suc A = A -> ( A e. suc A <-> A e. A ) )
13	12	notbid 667	. . . . . . . . 9 |- ( suc A = A -> ( -. A e. suc A <-> -. A e. A ) )
14	11, 13	syl5ibrcom 157	. . . . . . . 8 |- ( Ord A -> ( suc A = A -> -. A e. suc A ) )
15		sucidg 4418	. . . . . . . . 9 |- ( A e. V -> A e. suc A )
16	15	con3i 632	. . . . . . . 8 |- ( -. A e. suc A -> -. A e. V )
17	14, 16	syl6 33	. . . . . . 7 |- ( Ord A -> ( suc A = A -> -. A e. V ) )
18	17	adantl 277	. . . . . 6 |- ( ( A e. V /\ Ord A ) -> ( suc A = A -> -. A e. V ) )
19	10, 18	sylbid 150	. . . . 5 |- ( ( A e. V /\ Ord A ) -> ( suc A = U. suc A -> -. A e. V ) )
20	19	expimpd 363	. . . 4 |- ( A e. V -> ( ( Ord A /\ suc A = U. suc A ) -> -. A e. V ) )
21	5, 20	syl5 32	. . 3 |- ( A e. V -> ( Lim suc A -> -. A e. V ) )
22	21	con2d 624	. 2 |- ( A e. V -> ( A e. V -> -. Lim suc A ) )
23	22	pm2.43i 49	1 |- ( A e. V -> -. Lim suc A )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   = wceq 1353   e. wcel 2148   U.cuni 3811   Tr wtr 4103   Ord word 4364   Lim wlim 4366   suc csuc 4367

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-in1 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159  ax-setind 4538

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-v 2741  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-sn 3600  df-pr 3601  df-uni 3812  df-tr 4104  df-iord 4368  df-ilim 4371  df-suc 4373

This theorem is referenced by: (None)