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

Theorem sucprcreg 4653
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.
StepHypRef Expression
1 sucprc 4515 . 2  |-  ( -.  A  e.  _V  ->  suc 
A  =  A )
2 elirr 4645 . . . 4  |-  -.  A  e.  A
3 nfv 1577 . . . . 5  |-  F/ x  A  e.  A
4 eleq1 2294 . . . . 5  |-  ( x  =  A  ->  (
x  e.  A  <->  A  e.  A ) )
53, 4ceqsalg 2832 . . . 4  |-  ( A  e.  _V  ->  ( A. x ( x  =  A  ->  x  e.  A )  <->  A  e.  A ) )
62, 5mtbiri 682 . . 3  |-  ( A  e.  _V  ->  -.  A. x ( x  =  A  ->  x  e.  A ) )
7 velsn 3690 . . . . 5  |-  ( x  e.  { A }  <->  x  =  A )
8 olc 719 . . . . . 6  |-  ( x  e.  { A }  ->  ( x  e.  A  \/  x  e.  { A } ) )
9 elun 3350 . . . . . . 7  |-  ( x  e.  ( A  u.  { A } )  <->  ( x  e.  A  \/  x  e.  { A } ) )
10 ssid 3248 . . . . . . . . 9  |-  A  C_  A
11 df-suc 4474 . . . . . . . . . . 11  |-  suc  A  =  ( A  u.  { A } )
1211eqeq1i 2239 . . . . . . . . . 10  |-  ( suc 
A  =  A  <->  ( A  u.  { A } )  =  A )
13 sseq1 3251 . . . . . . . . . 10  |-  ( ( A  u.  { A } )  =  A  ->  ( ( A  u.  { A }
)  C_  A  <->  A  C_  A
) )
1412, 13sylbi 121 . . . . . . . . 9  |-  ( suc 
A  =  A  -> 
( ( A  u.  { A } )  C_  A 
<->  A  C_  A )
)
1510, 14mpbiri 168 . . . . . . . 8  |-  ( suc 
A  =  A  -> 
( A  u.  { A } )  C_  A
)
1615sseld 3227 . . . . . . 7  |-  ( suc 
A  =  A  -> 
( x  e.  ( A  u.  { A } )  ->  x  e.  A ) )
179, 16biimtrrid 153 . . . . . 6  |-  ( suc 
A  =  A  -> 
( ( x  e.  A  \/  x  e. 
{ A } )  ->  x  e.  A
) )
188, 17syl5 32 . . . . 5  |-  ( suc 
A  =  A  -> 
( x  e.  { A }  ->  x  e.  A ) )
197, 18biimtrrid 153 . . . 4  |-  ( suc 
A  =  A  -> 
( x  =  A  ->  x  e.  A
) )
2019alrimiv 1922 . . 3  |-  ( suc 
A  =  A  ->  A. x ( x  =  A  ->  x  e.  A ) )
216, 20nsyl3 631 . 2  |-  ( suc 
A  =  A  ->  -.  A  e.  _V )
221, 21impbii 126 1  |-  ( -.  A  e.  _V  <->  suc  A  =  A )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 105    \/ wo 716   A.wal 1396    = wceq 1398    e. wcel 2202   _Vcvv 2803    u. cun 3199    C_ wss 3201   {csn 3673   suc csuc 4468
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 619  ax-in2 620  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 2213  ax-setind 4641
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-v 2805  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-sn 3679  df-suc 4474
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator