MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ordsucelsuc Unicode version

Theorem ordsucelsuc 4613
Description: Membership is inherited by successors. Generalization of Exercise 9 of [TakeutiZaring] p. 42. (Contributed by NM, 22-Jun-1998.) (Proof shortened by Andrew Salmon, 12-Aug-2011.)
Assertion
Ref Expression
ordsucelsuc  |-  ( Ord 
B  ->  ( A  e.  B  <->  suc  A  e.  suc  B ) )

Proof of Theorem ordsucelsuc
StepHypRef Expression
1 simpl 443 . . 3  |-  ( ( Ord  B  /\  A  e.  B )  ->  Ord  B )
2 ordelord 4414 . . 3  |-  ( ( Ord  B  /\  A  e.  B )  ->  Ord  A )
31, 2jca 518 . 2  |-  ( ( Ord  B  /\  A  e.  B )  ->  ( Ord  B  /\  Ord  A
) )
4 simpl 443 . . 3  |-  ( ( Ord  B  /\  suc  A  e.  suc  B )  ->  Ord  B )
5 ordsuc 4605 . . . 4  |-  ( Ord 
B  <->  Ord  suc  B )
6 ordelord 4414 . . . . 5  |-  ( ( Ord  suc  B  /\  suc  A  e.  suc  B
)  ->  Ord  suc  A
)
7 ordsuc 4605 . . . . 5  |-  ( Ord 
A  <->  Ord  suc  A )
86, 7sylibr 203 . . . 4  |-  ( ( Ord  suc  B  /\  suc  A  e.  suc  B
)  ->  Ord  A )
95, 8sylanb 458 . . 3  |-  ( ( Ord  B  /\  suc  A  e.  suc  B )  ->  Ord  A )
104, 9jca 518 . 2  |-  ( ( Ord  B  /\  suc  A  e.  suc  B )  ->  ( Ord  B  /\  Ord  A ) )
11 ordsseleq 4421 . . . . . . . 8  |-  ( ( Ord  suc  A  /\  Ord  B )  ->  ( suc  A  C_  B  <->  ( suc  A  e.  B  \/  suc  A  =  B ) ) )
127, 11sylanb 458 . . . . . . 7  |-  ( ( Ord  A  /\  Ord  B )  ->  ( suc  A 
C_  B  <->  ( suc  A  e.  B  \/  suc  A  =  B ) ) )
1312ancoms 439 . . . . . 6  |-  ( ( Ord  B  /\  Ord  A )  ->  ( suc  A 
C_  B  <->  ( suc  A  e.  B  \/  suc  A  =  B ) ) )
1413adantl 452 . . . . 5  |-  ( ( A  e.  _V  /\  ( Ord  B  /\  Ord  A ) )  ->  ( suc  A  C_  B  <->  ( suc  A  e.  B  \/  suc  A  =  B ) ) )
15 ordsucss 4609 . . . . . . 7  |-  ( Ord 
B  ->  ( A  e.  B  ->  suc  A  C_  B ) )
1615ad2antrl 708 . . . . . 6  |-  ( ( A  e.  _V  /\  ( Ord  B  /\  Ord  A ) )  ->  ( A  e.  B  ->  suc 
A  C_  B )
)
17 sucssel 4485 . . . . . . 7  |-  ( A  e.  _V  ->  ( suc  A  C_  B  ->  A  e.  B ) )
1817adantr 451 . . . . . 6  |-  ( ( A  e.  _V  /\  ( Ord  B  /\  Ord  A ) )  ->  ( suc  A  C_  B  ->  A  e.  B ) )
1916, 18impbid 183 . . . . 5  |-  ( ( A  e.  _V  /\  ( Ord  B  /\  Ord  A ) )  ->  ( A  e.  B  <->  suc  A  C_  B ) )
20 sucexb 4600 . . . . . . 7  |-  ( A  e.  _V  <->  suc  A  e. 
_V )
21 elsucg 4459 . . . . . . 7  |-  ( suc 
A  e.  _V  ->  ( suc  A  e.  suc  B  <-> 
( suc  A  e.  B  \/  suc  A  =  B ) ) )
2220, 21sylbi 187 . . . . . 6  |-  ( A  e.  _V  ->  ( suc  A  e.  suc  B  <->  ( suc  A  e.  B  \/  suc  A  =  B ) ) )
2322adantr 451 . . . . 5  |-  ( ( A  e.  _V  /\  ( Ord  B  /\  Ord  A ) )  ->  ( suc  A  e.  suc  B  <->  ( suc  A  e.  B  \/  suc  A  =  B ) ) )
2414, 19, 233bitr4d 276 . . . 4  |-  ( ( A  e.  _V  /\  ( Ord  B  /\  Ord  A ) )  ->  ( A  e.  B  <->  suc  A  e. 
suc  B ) )
2524ex 423 . . 3  |-  ( A  e.  _V  ->  (
( Ord  B  /\  Ord  A )  ->  ( A  e.  B  <->  suc  A  e. 
suc  B ) ) )
26 elex 2796 . . . . 5  |-  ( A  e.  B  ->  A  e.  _V )
27 elex 2796 . . . . . 6  |-  ( suc 
A  e.  suc  B  ->  suc  A  e.  _V )
2827, 20sylibr 203 . . . . 5  |-  ( suc 
A  e.  suc  B  ->  A  e.  _V )
2926, 28pm5.21ni 341 . . . 4  |-  ( -.  A  e.  _V  ->  ( A  e.  B  <->  suc  A  e. 
suc  B ) )
3029a1d 22 . . 3  |-  ( -.  A  e.  _V  ->  ( ( Ord  B  /\  Ord  A )  ->  ( A  e.  B  <->  suc  A  e. 
suc  B ) ) )
3125, 30pm2.61i 156 . 2  |-  ( ( Ord  B  /\  Ord  A )  ->  ( A  e.  B  <->  suc  A  e.  suc  B ) )
323, 10, 31pm5.21nd 868 1  |-  ( Ord 
B  ->  ( A  e.  B  <->  suc  A  e.  suc  B ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 176    \/ wo 357    /\ wa 358    = wceq 1623    e. wcel 1684   _Vcvv 2788    C_ wss 3152   Ord word 4391   suc csuc 4394
This theorem is referenced by:  ordsucsssuc  4614  oalimcl  6558  omlimcl  6576  pssnn  7081  cantnflt  7373  cantnfp1lem3  7382  r1pw  7517  r1pwOLD  7518  rankelpr  7545  rankelop  7546  rankxplim3  7551  infpssrlem4  7932  axdc3lem2  8077  axdc3lem4  8079  grur1a  8441  tartarmap  25888  bnj570  28937  bnj1001  28990
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-13 1686  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-sep 4141  ax-nul 4149  ax-pr 4214  ax-un 4512
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-ral 2548  df-rex 2549  df-rab 2552  df-v 2790  df-sbc 2992  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pss 3168  df-nul 3456  df-if 3566  df-sn 3646  df-pr 3647  df-tp 3648  df-op 3649  df-uni 3828  df-br 4024  df-opab 4078  df-tr 4114  df-eprel 4305  df-po 4314  df-so 4315  df-fr 4352  df-we 4354  df-ord 4395  df-on 4396  df-suc 4398
  Copyright terms: Public domain W3C validator