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

Theorem bj-peano4 16895
Description: Remove from peano4 4739 dependency on ax-setind 4679. 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 1025 . . . . 5  |-  ( ( A  e.  om  /\  B  e.  om  /\  suc  A  =  suc  B )  ->  ( A  e. 
om  /\  B  e.  om ) )
2 pm3.22 265 . . . . 5  |-  ( ( A  e.  om  /\  B  e.  om )  ->  ( B  e.  om  /\  A  e.  om )
)
3 bj-nnen2lp 16894 . . . . 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 4556 . . . . . . . . . . . 12  |-  ( B  e.  om  ->  B  e.  suc  B )
6 eleq2 2302 . . . . . . . . . . . 12  |-  ( suc 
A  =  suc  B  ->  ( B  e.  suc  A  <-> 
B  e.  suc  B
) )
75, 6syl5ibrcom 157 . . . . . . . . . . 11  |-  ( B  e.  om  ->  ( suc  A  =  suc  B  ->  B  e.  suc  A
) )
8 elsucg 4544 . . . . . . . . . . 11  |-  ( B  e.  om  ->  ( B  e.  suc  A  <->  ( B  e.  A  \/  B  =  A ) ) )
97, 8sylibd 149 . . . . . . . . . 10  |-  ( B  e.  om  ->  ( suc  A  =  suc  B  ->  ( B  e.  A  \/  B  =  A
) ) )
109imp 124 . . . . . . . . 9  |-  ( ( B  e.  om  /\  suc  A  =  suc  B
)  ->  ( B  e.  A  \/  B  =  A ) )
11103adant1 1046 . . . . . . . 8  |-  ( ( A  e.  om  /\  B  e.  om  /\  suc  A  =  suc  B )  ->  ( B  e.  A  \/  B  =  A ) )
12 sucidg 4556 . . . . . . . . . . . 12  |-  ( A  e.  om  ->  A  e.  suc  A )
13 eleq2 2302 . . . . . . . . . . . 12  |-  ( suc 
A  =  suc  B  ->  ( A  e.  suc  A  <-> 
A  e.  suc  B
) )
1412, 13syl5ibcom 155 . . . . . . . . . . 11  |-  ( A  e.  om  ->  ( suc  A  =  suc  B  ->  A  e.  suc  B
) )
15 elsucg 4544 . . . . . . . . . . 11  |-  ( A  e.  om  ->  ( A  e.  suc  B  <->  ( A  e.  B  \/  A  =  B ) ) )
1614, 15sylibd 149 . . . . . . . . . 10  |-  ( A  e.  om  ->  ( suc  A  =  suc  B  ->  ( A  e.  B  \/  A  =  B
) ) )
1716imp 124 . . . . . . . . 9  |-  ( ( A  e.  om  /\  suc  A  =  suc  B
)  ->  ( A  e.  B  \/  A  =  B ) )
18173adant2 1047 . . . . . . . 8  |-  ( ( A  e.  om  /\  B  e.  om  /\  suc  A  =  suc  B )  ->  ( A  e.  B  \/  A  =  B ) )
1911, 18jca 306 . . . . . . 7  |-  ( ( A  e.  om  /\  B  e.  om  /\  suc  A  =  suc  B )  ->  ( ( B  e.  A  \/  B  =  A )  /\  ( A  e.  B  \/  A  =  B )
) )
20 eqcom 2240 . . . . . . . . 9  |-  ( B  =  A  <->  A  =  B )
2120orbi2i 774 . . . . . . . 8  |-  ( ( B  e.  A  \/  B  =  A )  <->  ( B  e.  A  \/  A  =  B )
)
2221anbi1i 462 . . . . . . 7  |-  ( ( ( B  e.  A  \/  B  =  A
)  /\  ( A  e.  B  \/  A  =  B ) )  <->  ( ( B  e.  A  \/  A  =  B )  /\  ( A  e.  B  \/  A  =  B
) ) )
2319, 22sylib 122 . . . . . 6  |-  ( ( A  e.  om  /\  B  e.  om  /\  suc  A  =  suc  B )  ->  ( ( B  e.  A  \/  A  =  B )  /\  ( A  e.  B  \/  A  =  B )
) )
24 ordir 829 . . . . . 6  |-  ( ( ( B  e.  A  /\  A  e.  B
)  \/  A  =  B )  <->  ( ( B  e.  A  \/  A  =  B )  /\  ( A  e.  B  \/  A  =  B
) ) )
2523, 24sylibr 134 . . . . 5  |-  ( ( A  e.  om  /\  B  e.  om  /\  suc  A  =  suc  B )  ->  ( ( B  e.  A  /\  A  e.  B )  \/  A  =  B ) )
2625ord 736 . . . 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 1236 . 2  |-  ( ( A  e.  om  /\  B  e.  om )  ->  ( suc  A  =  suc  B  ->  A  =  B ) )
29 suceq 4542 . 2  |-  ( A  =  B  ->  suc  A  =  suc  B )
3028, 29impbid1 142 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 104    <-> wb 105    \/ wo 720    /\ w3a 1009    = wceq 1402    e. wcel 2209   suc csuc 4505   omcom 4732
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-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-13 2211  ax-14 2212  ax-ext 2220  ax-nul 4254  ax-pr 4341  ax-un 4573  ax-bd0 16753  ax-bdor 16756  ax-bdn 16757  ax-bdal 16758  ax-bdex 16759  ax-bdeq 16760  ax-bdel 16761  ax-bdsb 16762  ax-bdsep 16824  ax-infvn 16881
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-sn 3711  df-pr 3712  df-uni 3931  df-int 3966  df-suc 4511  df-iom 4733  df-bdc 16781  df-bj-ind 16867
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator