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

Theorem bj-peano4 13489
Description: Remove from peano4 4554 dependency on ax-setind 4494. 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 979 . . . . 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 13488 . . . . 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 4375 . . . . . . . . . . . 12  |-  ( B  e.  om  ->  B  e.  suc  B )
6 eleq2 2221 . . . . . . . . . . . 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 4363 . . . . . . . . . . 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 1000 . . . . . . . 8  |-  ( ( A  e.  om  /\  B  e.  om  /\  suc  A  =  suc  B )  ->  ( B  e.  A  \/  B  =  A ) )
12 sucidg 4375 . . . . . . . . . . . 12  |-  ( A  e.  om  ->  A  e.  suc  A )
13 eleq2 2221 . . . . . . . . . . . 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 4363 . . . . . . . . . . 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 1001 . . . . . . . 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 2159 . . . . . . . . 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 1187 . 2  |-  ( ( A  e.  om  /\  B  e.  om )  ->  ( suc  A  =  suc  B  ->  A  =  B ) )
29 suceq 4361 . 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 963    = wceq 1335    e. wcel 2128   suc csuc 4324   omcom 4547
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 1427  ax-7 1428  ax-gen 1429  ax-ie1 1473  ax-ie2 1474  ax-8 1484  ax-10 1485  ax-11 1486  ax-i12 1487  ax-bndl 1489  ax-4 1490  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-13 2130  ax-14 2131  ax-ext 2139  ax-nul 4090  ax-pr 4168  ax-un 4392  ax-bd0 13347  ax-bdor 13350  ax-bdn 13351  ax-bdal 13352  ax-bdex 13353  ax-bdeq 13354  ax-bdel 13355  ax-bdsb 13356  ax-bdsep 13418  ax-infvn 13475
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1338  df-nf 1441  df-sb 1743  df-clab 2144  df-cleq 2150  df-clel 2153  df-nfc 2288  df-ral 2440  df-rex 2441  df-rab 2444  df-v 2714  df-dif 3104  df-un 3106  df-in 3108  df-ss 3115  df-nul 3395  df-sn 3566  df-pr 3567  df-uni 3773  df-int 3808  df-suc 4330  df-iom 4548  df-bdc 13375  df-bj-ind 13461
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator