Theorem bj-peano4 16090

Description: Remove from peano4 4663 dependency on ax-setind 4603. 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	⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (suc 𝐴 = suc 𝐵 ↔ 𝐴 = 𝐵))

Proof of Theorem bj-peano4

Step	Hyp	Ref	Expression
1		3simpa 997	. . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ suc 𝐴 = suc 𝐵) → (𝐴 ∈ ω ∧ 𝐵 ∈ ω))
2		pm3.22 265	. . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐵 ∈ ω ∧ 𝐴 ∈ ω))
3		bj-nnen2lp 16089	. . . . 5 ⊢ ((𝐵 ∈ ω ∧ 𝐴 ∈ ω) → ¬ (𝐵 ∈ 𝐴 ∧ 𝐴 ∈ 𝐵))
4	1, 2, 3	3syl 17	. . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ suc 𝐴 = suc 𝐵) → ¬ (𝐵 ∈ 𝐴 ∧ 𝐴 ∈ 𝐵))
5		sucidg 4481	. . . . . . . . . . . 12 ⊢ (𝐵 ∈ ω → 𝐵 ∈ suc 𝐵)
6		eleq2 2271	. . . . . . . . . . . 12 ⊢ (suc 𝐴 = suc 𝐵 → (𝐵 ∈ suc 𝐴 ↔ 𝐵 ∈ suc 𝐵))
7	5, 6	syl5ibrcom 157	. . . . . . . . . . 11 ⊢ (𝐵 ∈ ω → (suc 𝐴 = suc 𝐵 → 𝐵 ∈ suc 𝐴))
8		elsucg 4469	. . . . . . . . . . 11 ⊢ (𝐵 ∈ ω → (𝐵 ∈ suc 𝐴 ↔ (𝐵 ∈ 𝐴 ∨ 𝐵 = 𝐴)))
9	7, 8	sylibd 149	. . . . . . . . . 10 ⊢ (𝐵 ∈ ω → (suc 𝐴 = suc 𝐵 → (𝐵 ∈ 𝐴 ∨ 𝐵 = 𝐴)))
10	9	imp 124	. . . . . . . . 9 ⊢ ((𝐵 ∈ ω ∧ suc 𝐴 = suc 𝐵) → (𝐵 ∈ 𝐴 ∨ 𝐵 = 𝐴))
11	10	3adant1 1018	. . . . . . . 8 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ suc 𝐴 = suc 𝐵) → (𝐵 ∈ 𝐴 ∨ 𝐵 = 𝐴))
12		sucidg 4481	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ ω → 𝐴 ∈ suc 𝐴)
13		eleq2 2271	. . . . . . . . . . . 12 ⊢ (suc 𝐴 = suc 𝐵 → (𝐴 ∈ suc 𝐴 ↔ 𝐴 ∈ suc 𝐵))
14	12, 13	syl5ibcom 155	. . . . . . . . . . 11 ⊢ (𝐴 ∈ ω → (suc 𝐴 = suc 𝐵 → 𝐴 ∈ suc 𝐵))
15		elsucg 4469	. . . . . . . . . . 11 ⊢ (𝐴 ∈ ω → (𝐴 ∈ suc 𝐵 ↔ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵)))
16	14, 15	sylibd 149	. . . . . . . . . 10 ⊢ (𝐴 ∈ ω → (suc 𝐴 = suc 𝐵 → (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵)))
17	16	imp 124	. . . . . . . . 9 ⊢ ((𝐴 ∈ ω ∧ suc 𝐴 = suc 𝐵) → (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))
18	17	3adant2 1019	. . . . . . . 8 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ suc 𝐴 = suc 𝐵) → (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵))
19	11, 18	jca 306	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ suc 𝐴 = suc 𝐵) → ((𝐵 ∈ 𝐴 ∨ 𝐵 = 𝐴) ∧ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵)))
20		eqcom 2209	. . . . . . . . 9 ⊢ (𝐵 = 𝐴 ↔ 𝐴 = 𝐵)
21	20	orbi2i 764	. . . . . . . 8 ⊢ ((𝐵 ∈ 𝐴 ∨ 𝐵 = 𝐴) ↔ (𝐵 ∈ 𝐴 ∨ 𝐴 = 𝐵))
22	21	anbi1i 458	. . . . . . 7 ⊢ (((𝐵 ∈ 𝐴 ∨ 𝐵 = 𝐴) ∧ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵)) ↔ ((𝐵 ∈ 𝐴 ∨ 𝐴 = 𝐵) ∧ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵)))
23	19, 22	sylib 122	. . . . . 6 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ suc 𝐴 = suc 𝐵) → ((𝐵 ∈ 𝐴 ∨ 𝐴 = 𝐵) ∧ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵)))
24		ordir 819	. . . . . 6 ⊢ (((𝐵 ∈ 𝐴 ∧ 𝐴 ∈ 𝐵) ∨ 𝐴 = 𝐵) ↔ ((𝐵 ∈ 𝐴 ∨ 𝐴 = 𝐵) ∧ (𝐴 ∈ 𝐵 ∨ 𝐴 = 𝐵)))
25	23, 24	sylibr 134	. . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ suc 𝐴 = suc 𝐵) → ((𝐵 ∈ 𝐴 ∧ 𝐴 ∈ 𝐵) ∨ 𝐴 = 𝐵))
26	25	ord 726	. . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ suc 𝐴 = suc 𝐵) → (¬ (𝐵 ∈ 𝐴 ∧ 𝐴 ∈ 𝐵) → 𝐴 = 𝐵))
27	4, 26	mpd 13	. . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ suc 𝐴 = suc 𝐵) → 𝐴 = 𝐵)
28	27	3expia 1208	. 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (suc 𝐴 = suc 𝐵 → 𝐴 = 𝐵))
29		suceq 4467	. 2 ⊢ (𝐴 = 𝐵 → suc 𝐴 = suc 𝐵)
30	28, 29	impbid1 142	1 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (suc 𝐴 = suc 𝐵 ↔ 𝐴 = 𝐵))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 710   ∧ w3a 981   = wceq 1373   ∈ wcel 2178  suc csuc 4430  ωcom 4656

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 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-nul 4186  ax-pr 4269  ax-un 4498  ax-bd0 15948  ax-bdor 15951  ax-bdn 15952  ax-bdal 15953  ax-bdex 15954  ax-bdeq 15955  ax-bdel 15956  ax-bdsb 15957  ax-bdsep 16019  ax-infvn 16076

This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ral 2491  df-rex 2492  df-rab 2495  df-v 2778  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-nul 3469  df-sn 3649  df-pr 3650  df-uni 3865  df-int 3900  df-suc 4436  df-iom 4657  df-bdc 15976  df-bj-ind 16062

This theorem is referenced by: (None)