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

Theorem onsucelsucr 4600
Description: Membership is inherited by predecessors. The converse, for all ordinals, implies excluded middle, as shown at onsucelsucexmid 4622. However, the converse does hold where  B is a natural number, as seen at nnsucelsuc 6637. (Contributed by Jim Kingdon, 17-Jul-2019.)
Assertion
Ref Expression
onsucelsucr  |-  ( B  e.  On  ->  ( suc  A  e.  suc  B  ->  A  e.  B ) )

Proof of Theorem onsucelsucr
StepHypRef Expression
1 elex 2811 . . . 4  |-  ( suc 
A  e.  suc  B  ->  suc  A  e.  _V )
2 sucexb 4589 . . . 4  |-  ( A  e.  _V  <->  suc  A  e. 
_V )
31, 2sylibr 134 . . 3  |-  ( suc 
A  e.  suc  B  ->  A  e.  _V )
4 onelss 4478 . . . . . . 7  |-  ( B  e.  On  ->  ( suc  A  e.  B  ->  suc  A  C_  B )
)
5 eqimss 3278 . . . . . . . 8  |-  ( suc 
A  =  B  ->  suc  A  C_  B )
65a1i 9 . . . . . . 7  |-  ( B  e.  On  ->  ( suc  A  =  B  ->  suc  A  C_  B )
)
74, 6jaod 722 . . . . . 6  |-  ( B  e.  On  ->  (
( suc  A  e.  B  \/  suc  A  =  B )  ->  suc  A 
C_  B ) )
87adantl 277 . . . . 5  |-  ( ( A  e.  _V  /\  B  e.  On )  ->  ( ( suc  A  e.  B  \/  suc  A  =  B )  ->  suc  A  C_  B )
)
9 elsucg 4495 . . . . . . 7  |-  ( suc 
A  e.  _V  ->  ( suc  A  e.  suc  B  <-> 
( suc  A  e.  B  \/  suc  A  =  B ) ) )
102, 9sylbi 121 . . . . . 6  |-  ( A  e.  _V  ->  ( suc  A  e.  suc  B  <->  ( suc  A  e.  B  \/  suc  A  =  B ) ) )
1110adantr 276 . . . . 5  |-  ( ( A  e.  _V  /\  B  e.  On )  ->  ( suc  A  e. 
suc  B  <->  ( suc  A  e.  B  \/  suc  A  =  B ) ) )
12 eloni 4466 . . . . . 6  |-  ( B  e.  On  ->  Ord  B )
13 ordelsuc 4597 . . . . . 6  |-  ( ( A  e.  _V  /\  Ord  B )  ->  ( A  e.  B  <->  suc  A  C_  B ) )
1412, 13sylan2 286 . . . . 5  |-  ( ( A  e.  _V  /\  B  e.  On )  ->  ( A  e.  B  <->  suc 
A  C_  B )
)
158, 11, 143imtr4d 203 . . . 4  |-  ( ( A  e.  _V  /\  B  e.  On )  ->  ( suc  A  e. 
suc  B  ->  A  e.  B ) )
1615impancom 260 . . 3  |-  ( ( A  e.  _V  /\  suc  A  e.  suc  B
)  ->  ( B  e.  On  ->  A  e.  B ) )
173, 16mpancom 422 . 2  |-  ( suc 
A  e.  suc  B  ->  ( B  e.  On  ->  A  e.  B ) )
1817com12 30 1  |-  ( B  e.  On  ->  ( suc  A  e.  suc  B  ->  A  e.  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 713    = wceq 1395    e. wcel 2200   _Vcvv 2799    C_ wss 3197   Ord word 4453   Oncon0 4454   suc csuc 4456
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-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524
This theorem depends on definitions:  df-bi 117  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-uni 3889  df-tr 4183  df-iord 4457  df-on 4459  df-suc 4462
This theorem is referenced by:  nnsucelsuc  6637
  Copyright terms: Public domain W3C validator