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

Theorem sucprcreg 4273
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 4149 . 2  |-  ( -.  A  e.  _V  ->  suc 
A  =  A )
2 elirr 4266 . . . 4  |-  -.  A  e.  A
3 nfv 1421 . . . . 5  |-  F/ x  A  e.  A
4 eleq1 2100 . . . . 5  |-  ( x  =  A  ->  (
x  e.  A  <->  A  e.  A ) )
53, 4ceqsalg 2582 . . . 4  |-  ( A  e.  _V  ->  ( A. x ( x  =  A  ->  x  e.  A )  <->  A  e.  A ) )
62, 5mtbiri 600 . . 3  |-  ( A  e.  _V  ->  -.  A. x ( x  =  A  ->  x  e.  A ) )
7 velsn 3392 . . . . 5  |-  ( x  e.  { A }  <->  x  =  A )
8 olc 632 . . . . . 6  |-  ( x  e.  { A }  ->  ( x  e.  A  \/  x  e.  { A } ) )
9 elun 3084 . . . . . . 7  |-  ( x  e.  ( A  u.  { A } )  <->  ( x  e.  A  \/  x  e.  { A } ) )
10 ssid 2964 . . . . . . . . 9  |-  A  C_  A
11 df-suc 4108 . . . . . . . . . . 11  |-  suc  A  =  ( A  u.  { A } )
1211eqeq1i 2047 . . . . . . . . . 10  |-  ( suc 
A  =  A  <->  ( A  u.  { A } )  =  A )
13 sseq1 2966 . . . . . . . . . 10  |-  ( ( A  u.  { A } )  =  A  ->  ( ( A  u.  { A }
)  C_  A  <->  A  C_  A
) )
1412, 13sylbi 114 . . . . . . . . 9  |-  ( suc 
A  =  A  -> 
( ( A  u.  { A } )  C_  A 
<->  A  C_  A )
)
1510, 14mpbiri 157 . . . . . . . 8  |-  ( suc 
A  =  A  -> 
( A  u.  { A } )  C_  A
)
1615sseld 2944 . . . . . . 7  |-  ( suc 
A  =  A  -> 
( x  e.  ( A  u.  { A } )  ->  x  e.  A ) )
179, 16syl5bir 142 . . . . . 6  |-  ( suc 
A  =  A  -> 
( ( x  e.  A  \/  x  e. 
{ A } )  ->  x  e.  A
) )
188, 17syl5 28 . . . . 5  |-  ( suc 
A  =  A  -> 
( x  e.  { A }  ->  x  e.  A ) )
197, 18syl5bir 142 . . . 4  |-  ( suc 
A  =  A  -> 
( x  =  A  ->  x  e.  A
) )
2019alrimiv 1754 . . 3  |-  ( suc 
A  =  A  ->  A. x ( x  =  A  ->  x  e.  A ) )
216, 20nsyl3 556 . 2  |-  ( suc 
A  =  A  ->  -.  A  e.  _V )
221, 21impbii 117 1  |-  ( -.  A  e.  _V  <->  suc  A  =  A )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 98    \/ wo 629   A.wal 1241    = wceq 1243    e. wcel 1393   _Vcvv 2557    u. cun 2915    C_ wss 2917   {csn 3375   suc csuc 4102
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 544  ax-in2 545  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-setind 4262
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-fal 1249  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ne 2206  df-ral 2311  df-v 2559  df-dif 2920  df-un 2922  df-in 2924  df-ss 2931  df-nul 3225  df-sn 3381  df-suc 4108
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator