Theorem sucprcreg 4533

Description: A class is equal to its successor iff it is a proper class (assuming the Axiom of Set Induction). (Contributed by NM, 9-Jul-2004.)

Assertion

Ref	Expression
sucprcreg	|- ( -. A e. _V <-> suc A = A )

Proof of Theorem sucprcreg

Dummy variable x is distinct from all other variables.

Step	Hyp	Ref	Expression
1		sucprc 4397	. 2 |- ( -. A e. _V -> suc A = A )
2		elirr 4525	. . . 4 |- -. A e. A
3		nfv 1521	. . . . 5 |- F/ x A e. A
4		eleq1 2233	. . . . 5 |- ( x = A -> ( x e. A <-> A e. A ) )
5	3, 4	ceqsalg 2758	. . . 4 |- ( A e. _V -> ( A. x ( x = A -> x e. A ) <-> A e. A ) )
6	2, 5	mtbiri 670	. . 3 |- ( A e. _V -> -. A. x ( x = A -> x e. A ) )
7		velsn 3600	. . . . 5 |- ( x e. { A } <-> x = A )
8		olc 706	. . . . . 6 |- ( x e. { A } -> ( x e. A \/ x e. { A } ) )
9		elun 3268	. . . . . . 7 |- ( x e. ( A u. { A } ) <-> ( x e. A \/ x e. { A } ) )
10		ssid 3167	. . . . . . . . 9 |- A C_ A
11		df-suc 4356	. . . . . . . . . . 11 |- suc A = ( A u. { A } )
12	11	eqeq1i 2178	. . . . . . . . . 10 |- ( suc A = A <-> ( A u. { A } ) = A )
13		sseq1 3170	. . . . . . . . . 10 |- ( ( A u. { A } ) = A -> ( ( A u. { A } ) C_ A <-> A C_ A ) )
14	12, 13	sylbi 120	. . . . . . . . 9 |- ( suc A = A -> ( ( A u. { A } ) C_ A <-> A C_ A ) )
15	10, 14	mpbiri 167	. . . . . . . 8 |- ( suc A = A -> ( A u. { A } ) C_ A )
16	15	sseld 3146	. . . . . . 7 |- ( suc A = A -> ( x e. ( A u. { A } ) -> x e. A ) )
17	9, 16	syl5bir 152	. . . . . 6 |- ( suc A = A -> ( ( x e. A \/ x e. { A } ) -> x e. A ) )
18	8, 17	syl5 32	. . . . 5 |- ( suc A = A -> ( x e. { A } -> x e. A ) )
19	7, 18	syl5bir 152	. . . 4 |- ( suc A = A -> ( x = A -> x e. A ) )
20	19	alrimiv 1867	. . 3 |- ( suc A = A -> A. x ( x = A -> x e. A ) )
21	6, 20	nsyl3 621	. 2 |- ( suc A = A -> -. A e. _V )
22	1, 21	impbii 125	1 |- ( -. A e. _V <-> suc A = A )

Syntax hints:   -. wn 3   -> wi 4   <-> wb 104   \/ wo 703   A.wal 1346   = wceq 1348   e. wcel 2141   _Vcvv 2730   u. cun 3119   C_ wss 3121   {csn 3583   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-fal 1354  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-v 2732  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-nul 3415  df-sn 3589  df-suc 4356

This theorem is referenced by: (None)