Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >   Mathboxes  >  bj-peano4 Unicode version

Theorem bj-peano4 13837
Description: Remove from peano4 4574 dependency on ax-setind 4514. Therefore, it only requires core constructive axioms (albeit more of them). (Contributed by BJ, 28-Nov-2019.) (Proof modification is discouraged.)
Assertion
Ref Expression
bj-peano4  |-  ( ( A  e.  om  /\  B  e.  om )  ->  ( suc  A  =  suc  B  <->  A  =  B ) )

Proof of Theorem bj-peano4
StepHypRef Expression
1 3simpa 984 . . . . 5  |-  ( ( A  e.  om  /\  B  e.  om  /\  suc  A  =  suc  B )  ->  ( A  e. 
om  /\  B  e.  om ) )
2 pm3.22 263 . . . . 5  |-  ( ( A  e.  om  /\  B  e.  om )  ->  ( B  e.  om  /\  A  e.  om )
)
3 bj-nnen2lp 13836 . . . . 5  |-  ( ( B  e.  om  /\  A  e.  om )  ->  -.  ( B  e.  A  /\  A  e.  B ) )
41, 2, 33syl 17 . . . 4  |-  ( ( A  e.  om  /\  B  e.  om  /\  suc  A  =  suc  B )  ->  -.  ( B  e.  A  /\  A  e.  B ) )
5 sucidg 4394 . . . . . . . . . . . 12  |-  ( B  e.  om  ->  B  e.  suc  B )
6 eleq2 2230 . . . . . . . . . . . 12  |-  ( suc 
A  =  suc  B  ->  ( B  e.  suc  A  <-> 
B  e.  suc  B
) )
75, 6syl5ibrcom 156 . . . . . . . . . . 11  |-  ( B  e.  om  ->  ( suc  A  =  suc  B  ->  B  e.  suc  A
) )
8 elsucg 4382 . . . . . . . . . . 11  |-  ( B  e.  om  ->  ( B  e.  suc  A  <->  ( B  e.  A  \/  B  =  A ) ) )
97, 8sylibd 148 . . . . . . . . . 10  |-  ( B  e.  om  ->  ( suc  A  =  suc  B  ->  ( B  e.  A  \/  B  =  A
) ) )
109imp 123 . . . . . . . . 9  |-  ( ( B  e.  om  /\  suc  A  =  suc  B
)  ->  ( B  e.  A  \/  B  =  A ) )
11103adant1 1005 . . . . . . . 8  |-  ( ( A  e.  om  /\  B  e.  om  /\  suc  A  =  suc  B )  ->  ( B  e.  A  \/  B  =  A ) )
12 sucidg 4394 . . . . . . . . . . . 12  |-  ( A  e.  om  ->  A  e.  suc  A )
13 eleq2 2230 . . . . . . . . . . . 12  |-  ( suc 
A  =  suc  B  ->  ( A  e.  suc  A  <-> 
A  e.  suc  B
) )
1412, 13syl5ibcom 154 . . . . . . . . . . 11  |-  ( A  e.  om  ->  ( suc  A  =  suc  B  ->  A  e.  suc  B
) )
15 elsucg 4382 . . . . . . . . . . 11  |-  ( A  e.  om  ->  ( A  e.  suc  B  <->  ( A  e.  B  \/  A  =  B ) ) )
1614, 15sylibd 148 . . . . . . . . . 10  |-  ( A  e.  om  ->  ( suc  A  =  suc  B  ->  ( A  e.  B  \/  A  =  B
) ) )
1716imp 123 . . . . . . . . 9  |-  ( ( A  e.  om  /\  suc  A  =  suc  B
)  ->  ( A  e.  B  \/  A  =  B ) )
18173adant2 1006 . . . . . . . 8  |-  ( ( A  e.  om  /\  B  e.  om  /\  suc  A  =  suc  B )  ->  ( A  e.  B  \/  A  =  B ) )
1911, 18jca 304 . . . . . . 7  |-  ( ( A  e.  om  /\  B  e.  om  /\  suc  A  =  suc  B )  ->  ( ( B  e.  A  \/  B  =  A )  /\  ( A  e.  B  \/  A  =  B )
) )
20 eqcom 2167 . . . . . . . . 9  |-  ( B  =  A  <->  A  =  B )
2120orbi2i 752 . . . . . . . 8  |-  ( ( B  e.  A  \/  B  =  A )  <->  ( B  e.  A  \/  A  =  B )
)
2221anbi1i 454 . . . . . . 7  |-  ( ( ( B  e.  A  \/  B  =  A
)  /\  ( A  e.  B  \/  A  =  B ) )  <->  ( ( B  e.  A  \/  A  =  B )  /\  ( A  e.  B  \/  A  =  B
) ) )
2319, 22sylib 121 . . . . . 6  |-  ( ( A  e.  om  /\  B  e.  om  /\  suc  A  =  suc  B )  ->  ( ( B  e.  A  \/  A  =  B )  /\  ( A  e.  B  \/  A  =  B )
) )
24 ordir 807 . . . . . 6  |-  ( ( ( B  e.  A  /\  A  e.  B
)  \/  A  =  B )  <->  ( ( B  e.  A  \/  A  =  B )  /\  ( A  e.  B  \/  A  =  B
) ) )
2523, 24sylibr 133 . . . . 5  |-  ( ( A  e.  om  /\  B  e.  om  /\  suc  A  =  suc  B )  ->  ( ( B  e.  A  /\  A  e.  B )  \/  A  =  B ) )
2625ord 714 . . . 4  |-  ( ( A  e.  om  /\  B  e.  om  /\  suc  A  =  suc  B )  ->  ( -.  ( B  e.  A  /\  A  e.  B )  ->  A  =  B ) )
274, 26mpd 13 . . 3  |-  ( ( A  e.  om  /\  B  e.  om  /\  suc  A  =  suc  B )  ->  A  =  B )
28273expia 1195 . 2  |-  ( ( A  e.  om  /\  B  e.  om )  ->  ( suc  A  =  suc  B  ->  A  =  B ) )
29 suceq 4380 . 2  |-  ( A  =  B  ->  suc  A  =  suc  B )
3028, 29impbid1 141 1  |-  ( ( A  e.  om  /\  B  e.  om )  ->  ( suc  A  =  suc  B  <->  A  =  B ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 103    <-> wb 104    \/ wo 698    /\ w3a 968    = wceq 1343    e. wcel 2136   suc csuc 4343   omcom 4567
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-nul 4108  ax-pr 4187  ax-un 4411  ax-bd0 13695  ax-bdor 13698  ax-bdn 13699  ax-bdal 13700  ax-bdex 13701  ax-bdeq 13702  ax-bdel 13703  ax-bdsb 13704  ax-bdsep 13766  ax-infvn 13823
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-rab 2453  df-v 2728  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-nul 3410  df-sn 3582  df-pr 3583  df-uni 3790  df-int 3825  df-suc 4349  df-iom 4568  df-bdc 13723  df-bj-ind 13809
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator