Theorem bj-peano4 13142

Description: Remove from peano4 4506 dependency on ax-setind 4447. 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

Step	Hyp	Ref	Expression
1		3simpa 978	. . . . 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 13141	. . . . 5 |- ( ( B e. om /\ A e. om ) -> -. ( B e. A /\ A e. B ) )
4	1, 2, 3	3syl 17	. . . 4 |- ( ( A e. om /\ B e. om /\ suc A = suc B ) -> -. ( B e. A /\ A e. B ) )
5		sucidg 4333	. . . . . . . . . . . 12 |- ( B e. om -> B e. suc B )
6		eleq2 2201	. . . . . . . . . . . 12 |- ( suc A = suc B -> ( B e. suc A <-> B e. suc B ) )
7	5, 6	syl5ibrcom 156	. . . . . . . . . . 11 |- ( B e. om -> ( suc A = suc B -> B e. suc A ) )
8		elsucg 4321	. . . . . . . . . . 11 |- ( B e. om -> ( B e. suc A <-> ( B e. A \/ B = A ) ) )
9	7, 8	sylibd 148	. . . . . . . . . 10 |- ( B e. om -> ( suc A = suc B -> ( B e. A \/ B = A ) ) )
10	9	imp 123	. . . . . . . . 9 |- ( ( B e. om /\ suc A = suc B ) -> ( B e. A \/ B = A ) )
11	10	3adant1 999	. . . . . . . 8 |- ( ( A e. om /\ B e. om /\ suc A = suc B ) -> ( B e. A \/ B = A ) )
12		sucidg 4333	. . . . . . . . . . . 12 |- ( A e. om -> A e. suc A )
13		eleq2 2201	. . . . . . . . . . . 12 |- ( suc A = suc B -> ( A e. suc A <-> A e. suc B ) )
14	12, 13	syl5ibcom 154	. . . . . . . . . . 11 |- ( A e. om -> ( suc A = suc B -> A e. suc B ) )
15		elsucg 4321	. . . . . . . . . . 11 |- ( A e. om -> ( A e. suc B <-> ( A e. B \/ A = B ) ) )
16	14, 15	sylibd 148	. . . . . . . . . 10 |- ( A e. om -> ( suc A = suc B -> ( A e. B \/ A = B ) ) )
17	16	imp 123	. . . . . . . . 9 |- ( ( A e. om /\ suc A = suc B ) -> ( A e. B \/ A = B ) )
18	17	3adant2 1000	. . . . . . . 8 |- ( ( A e. om /\ B e. om /\ suc A = suc B ) -> ( A e. B \/ A = B ) )
19	11, 18	jca 304	. . . . . . 7 |- ( ( A e. om /\ B e. om /\ suc A = suc B ) -> ( ( B e. A \/ B = A ) /\ ( A e. B \/ A = B ) ) )
20		eqcom 2139	. . . . . . . . 9 |- ( B = A <-> A = B )
21	20	orbi2i 751	. . . . . . . 8 |- ( ( B e. A \/ B = A ) <-> ( B e. A \/ A = B ) )
22	21	anbi1i 453	. . . . . . 7 |- ( ( ( B e. A \/ B = A ) /\ ( A e. B \/ A = B ) ) <-> ( ( B e. A \/ A = B ) /\ ( A e. B \/ A = B ) ) )
23	19, 22	sylib 121	. . . . . 6 |- ( ( A e. om /\ B e. om /\ suc A = suc B ) -> ( ( B e. A \/ A = B ) /\ ( A e. B \/ A = B ) ) )
24		ordir 806	. . . . . 6 |- ( ( ( B e. A /\ A e. B ) \/ A = B ) <-> ( ( B e. A \/ A = B ) /\ ( A e. B \/ A = B ) ) )
25	23, 24	sylibr 133	. . . . 5 |- ( ( A e. om /\ B e. om /\ suc A = suc B ) -> ( ( B e. A /\ A e. B ) \/ A = B ) )
26	25	ord 713	. . . 4 |- ( ( A e. om /\ B e. om /\ suc A = suc B ) -> ( -. ( B e. A /\ A e. B ) -> A = B ) )
27	4, 26	mpd 13	. . 3 |- ( ( A e. om /\ B e. om /\ suc A = suc B ) -> A = B )
28	27	3expia 1183	. 2 |- ( ( A e. om /\ B e. om ) -> ( suc A = suc B -> A = B ) )
29		suceq 4319	. 2 |- ( A = B -> suc A = suc B )
30	28, 29	impbid1 141	1 |- ( ( A e. om /\ B e. om ) -> ( suc A = suc B <-> A = B ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 103   <-> wb 104   \/ wo 697   /\ w3a 962   = wceq 1331   e. wcel 1480   suc csuc 4282   omcom 4499

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 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-nul 4049  ax-pr 4126  ax-un 4350  ax-bd0 13000  ax-bdor 13003  ax-bdn 13004  ax-bdal 13005  ax-bdex 13006  ax-bdeq 13007  ax-bdel 13008  ax-bdsb 13009  ax-bdsep 13071  ax-infvn 13128

This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-rex 2420  df-rab 2423  df-v 2683  df-dif 3068  df-un 3070  df-in 3072  df-ss 3079  df-nul 3359  df-sn 3528  df-pr 3529  df-uni 3732  df-int 3767  df-suc 4288  df-iom 4500  df-bdc 13028  df-bj-ind 13114

This theorem is referenced by: (None)