Theorem nnsucelsuc 6070

Description: Membership is inherited by successors. The reverse direction holds for all ordinals, as seen at onsucelsucr 4234, but the forward direction, for all ordinals, implies excluded middle as seen as onsucelsucexmid 4255. (Contributed by Jim Kingdon, 25-Aug-2019.)

Assertion

Ref	Expression
nnsucelsuc	⊢ (𝐵 ∈ ω → (𝐴 ∈ 𝐵 ↔ suc 𝐴 ∈ suc 𝐵))

Proof of Theorem nnsucelsuc

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eleq2 2101	. . . 4 ⊢ (𝑥 = ∅ → (𝐴 ∈ 𝑥 ↔ 𝐴 ∈ ∅))
2		suceq 4139	. . . . 5 ⊢ (𝑥 = ∅ → suc 𝑥 = suc ∅)
3	2	eleq2d 2107	. . . 4 ⊢ (𝑥 = ∅ → (suc 𝐴 ∈ suc 𝑥 ↔ suc 𝐴 ∈ suc ∅))
4	1, 3	imbi12d 223	. . 3 ⊢ (𝑥 = ∅ → ((𝐴 ∈ 𝑥 → suc 𝐴 ∈ suc 𝑥) ↔ (𝐴 ∈ ∅ → suc 𝐴 ∈ suc ∅)))
5		eleq2 2101	. . . 4 ⊢ (𝑥 = 𝑦 → (𝐴 ∈ 𝑥 ↔ 𝐴 ∈ 𝑦))
6		suceq 4139	. . . . 5 ⊢ (𝑥 = 𝑦 → suc 𝑥 = suc 𝑦)
7	6	eleq2d 2107	. . . 4 ⊢ (𝑥 = 𝑦 → (suc 𝐴 ∈ suc 𝑥 ↔ suc 𝐴 ∈ suc 𝑦))
8	5, 7	imbi12d 223	. . 3 ⊢ (𝑥 = 𝑦 → ((𝐴 ∈ 𝑥 → suc 𝐴 ∈ suc 𝑥) ↔ (𝐴 ∈ 𝑦 → suc 𝐴 ∈ suc 𝑦)))
9		eleq2 2101	. . . 4 ⊢ (𝑥 = suc 𝑦 → (𝐴 ∈ 𝑥 ↔ 𝐴 ∈ suc 𝑦))
10		suceq 4139	. . . . 5 ⊢ (𝑥 = suc 𝑦 → suc 𝑥 = suc suc 𝑦)
11	10	eleq2d 2107	. . . 4 ⊢ (𝑥 = suc 𝑦 → (suc 𝐴 ∈ suc 𝑥 ↔ suc 𝐴 ∈ suc suc 𝑦))
12	9, 11	imbi12d 223	. . 3 ⊢ (𝑥 = suc 𝑦 → ((𝐴 ∈ 𝑥 → suc 𝐴 ∈ suc 𝑥) ↔ (𝐴 ∈ suc 𝑦 → suc 𝐴 ∈ suc suc 𝑦)))
13		eleq2 2101	. . . 4 ⊢ (𝑥 = 𝐵 → (𝐴 ∈ 𝑥 ↔ 𝐴 ∈ 𝐵))
14		suceq 4139	. . . . 5 ⊢ (𝑥 = 𝐵 → suc 𝑥 = suc 𝐵)
15	14	eleq2d 2107	. . . 4 ⊢ (𝑥 = 𝐵 → (suc 𝐴 ∈ suc 𝑥 ↔ suc 𝐴 ∈ suc 𝐵))
16	13, 15	imbi12d 223	. . 3 ⊢ (𝑥 = 𝐵 → ((𝐴 ∈ 𝑥 → suc 𝐴 ∈ suc 𝑥) ↔ (𝐴 ∈ 𝐵 → suc 𝐴 ∈ suc 𝐵)))
17		noel 3228	. . . 4 ⊢ ¬ 𝐴 ∈ ∅
18	17	pm2.21i 575	. . 3 ⊢ (𝐴 ∈ ∅ → suc 𝐴 ∈ suc ∅)
19		elsuci 4140	. . . . . . . 8 ⊢ (𝐴 ∈ suc 𝑦 → (𝐴 ∈ 𝑦 ∨ 𝐴 = 𝑦))
20	19	adantl 262	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑦 → suc 𝐴 ∈ suc 𝑦) ∧ 𝐴 ∈ suc 𝑦) → (𝐴 ∈ 𝑦 ∨ 𝐴 = 𝑦))
21		simpl 102	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑦 → suc 𝐴 ∈ suc 𝑦) ∧ 𝐴 ∈ suc 𝑦) → (𝐴 ∈ 𝑦 → suc 𝐴 ∈ suc 𝑦))
22		suceq 4139	. . . . . . . . 9 ⊢ (𝐴 = 𝑦 → suc 𝐴 = suc 𝑦)
23	22	a1i 9	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑦 → suc 𝐴 ∈ suc 𝑦) ∧ 𝐴 ∈ suc 𝑦) → (𝐴 = 𝑦 → suc 𝐴 = suc 𝑦))
24	21, 23	orim12d 700	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑦 → suc 𝐴 ∈ suc 𝑦) ∧ 𝐴 ∈ suc 𝑦) → ((𝐴 ∈ 𝑦 ∨ 𝐴 = 𝑦) → (suc 𝐴 ∈ suc 𝑦 ∨ suc 𝐴 = suc 𝑦)))
25	20, 24	mpd 13	. . . . . 6 ⊢ (((𝐴 ∈ 𝑦 → suc 𝐴 ∈ suc 𝑦) ∧ 𝐴 ∈ suc 𝑦) → (suc 𝐴 ∈ suc 𝑦 ∨ suc 𝐴 = suc 𝑦))
26		vex 2560	. . . . . . . 8 ⊢ 𝑦 ∈ V
27	26	sucex 4225	. . . . . . 7 ⊢ suc 𝑦 ∈ V
28	27	elsuc2 4144	. . . . . 6 ⊢ (suc 𝐴 ∈ suc suc 𝑦 ↔ (suc 𝐴 ∈ suc 𝑦 ∨ suc 𝐴 = suc 𝑦))
29	25, 28	sylibr 137	. . . . 5 ⊢ (((𝐴 ∈ 𝑦 → suc 𝐴 ∈ suc 𝑦) ∧ 𝐴 ∈ suc 𝑦) → suc 𝐴 ∈ suc suc 𝑦)
30	29	ex 108	. . . 4 ⊢ ((𝐴 ∈ 𝑦 → suc 𝐴 ∈ suc 𝑦) → (𝐴 ∈ suc 𝑦 → suc 𝐴 ∈ suc suc 𝑦))
31	30	a1i 9	. . 3 ⊢ (𝑦 ∈ ω → ((𝐴 ∈ 𝑦 → suc 𝐴 ∈ suc 𝑦) → (𝐴 ∈ suc 𝑦 → suc 𝐴 ∈ suc suc 𝑦)))
32	4, 8, 12, 16, 18, 31	finds 4323	. 2 ⊢ (𝐵 ∈ ω → (𝐴 ∈ 𝐵 → suc 𝐴 ∈ suc 𝐵))
33		nnon 4332	. . 3 ⊢ (𝐵 ∈ ω → 𝐵 ∈ On)
34		onsucelsucr 4234	. . 3 ⊢ (𝐵 ∈ On → (suc 𝐴 ∈ suc 𝐵 → 𝐴 ∈ 𝐵))
35	33, 34	syl 14	. 2 ⊢ (𝐵 ∈ ω → (suc 𝐴 ∈ suc 𝐵 → 𝐴 ∈ 𝐵))
36	32, 35	impbid 120	1 ⊢ (𝐵 ∈ ω → (𝐴 ∈ 𝐵 ↔ suc 𝐴 ∈ suc 𝐵))

Syntax hints:   → wi 4   ∧ wa 97   ↔ wb 98   ∨ wo 629   = wceq 1243   ∈ wcel 1393  ∅c0 3224  Oncon0 4100  suc csuc 4102  ωcom 4313

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 544  ax-in2 545  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-13 1404  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875  ax-nul 3883  ax-pow 3927  ax-pr 3944  ax-un 4170  ax-iinf 4311

This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-v 2559  df-dif 2920  df-un 2922  df-in 2924  df-ss 2931  df-nul 3225  df-pw 3361  df-sn 3381  df-pr 3382  df-uni 3581  df-int 3616  df-tr 3855  df-iord 4103  df-on 4105  df-suc 4108  df-iom 4314

This theorem is referenced by:  nnsucsssuc  6071  nntri3or  6072  nnaordi  6081