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

Theorem onsucelsucr 4544
Description: Membership is inherited by predecessors. The converse, for all ordinals, implies excluded middle, as shown at onsucelsucexmid 4566. However, the converse does hold where  B is a natural number, as seen at nnsucelsuc 6549. (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 2774 . . . 4  |-  ( suc 
A  e.  suc  B  ->  suc  A  e.  _V )
2 sucexb 4533 . . . 4  |-  ( A  e.  _V  <->  suc  A  e. 
_V )
31, 2sylibr 134 . . 3  |-  ( suc 
A  e.  suc  B  ->  A  e.  _V )
4 onelss 4422 . . . . . . 7  |-  ( B  e.  On  ->  ( suc  A  e.  B  ->  suc  A  C_  B )
)
5 eqimss 3237 . . . . . . . 8  |-  ( suc 
A  =  B  ->  suc  A  C_  B )
65a1i 9 . . . . . . 7  |-  ( B  e.  On  ->  ( suc  A  =  B  ->  suc  A  C_  B )
)
74, 6jaod 718 . . . . . 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 4439 . . . . . . 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 4410 . . . . . 6  |-  ( B  e.  On  ->  Ord  B )
13 ordelsuc 4541 . . . . . 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 709    = wceq 1364    e. wcel 2167   _Vcvv 2763    C_ wss 3157   Ord word 4397   Oncon0 4398   suc csuc 4400
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242  ax-un 4468
This theorem depends on definitions:  df-bi 117  df-tru 1367  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-v 2765  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-uni 3840  df-tr 4132  df-iord 4401  df-on 4403  df-suc 4406
This theorem is referenced by:  nnsucelsuc  6549
  Copyright terms: Public domain W3C validator