Theorem nnsucelsuc 6754

Description: Membership is inherited by successors. The reverse direction holds for all ordinals, as seen at onsucelsucr 4650, but the forward direction, for all ordinals, implies excluded middle as seen as onsucelsucexmid 4672. (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 2302	. . . 4 ⊢ (𝑥 = ∅ → (𝐴 ∈ 𝑥 ↔ 𝐴 ∈ ∅))
2		suceq 4542	. . . . 5 ⊢ (𝑥 = ∅ → suc 𝑥 = suc ∅)
3	2	eleq2d 2308	. . . 4 ⊢ (𝑥 = ∅ → (suc 𝐴 ∈ suc 𝑥 ↔ suc 𝐴 ∈ suc ∅))
4	1, 3	imbi12d 234	. . 3 ⊢ (𝑥 = ∅ → ((𝐴 ∈ 𝑥 → suc 𝐴 ∈ suc 𝑥) ↔ (𝐴 ∈ ∅ → suc 𝐴 ∈ suc ∅)))
5		eleq2 2302	. . . 4 ⊢ (𝑥 = 𝑦 → (𝐴 ∈ 𝑥 ↔ 𝐴 ∈ 𝑦))
6		suceq 4542	. . . . 5 ⊢ (𝑥 = 𝑦 → suc 𝑥 = suc 𝑦)
7	6	eleq2d 2308	. . . 4 ⊢ (𝑥 = 𝑦 → (suc 𝐴 ∈ suc 𝑥 ↔ suc 𝐴 ∈ suc 𝑦))
8	5, 7	imbi12d 234	. . 3 ⊢ (𝑥 = 𝑦 → ((𝐴 ∈ 𝑥 → suc 𝐴 ∈ suc 𝑥) ↔ (𝐴 ∈ 𝑦 → suc 𝐴 ∈ suc 𝑦)))
9		eleq2 2302	. . . 4 ⊢ (𝑥 = suc 𝑦 → (𝐴 ∈ 𝑥 ↔ 𝐴 ∈ suc 𝑦))
10		suceq 4542	. . . . 5 ⊢ (𝑥 = suc 𝑦 → suc 𝑥 = suc suc 𝑦)
11	10	eleq2d 2308	. . . 4 ⊢ (𝑥 = suc 𝑦 → (suc 𝐴 ∈ suc 𝑥 ↔ suc 𝐴 ∈ suc suc 𝑦))
12	9, 11	imbi12d 234	. . 3 ⊢ (𝑥 = suc 𝑦 → ((𝐴 ∈ 𝑥 → suc 𝐴 ∈ suc 𝑥) ↔ (𝐴 ∈ suc 𝑦 → suc 𝐴 ∈ suc suc 𝑦)))
13		eleq2 2302	. . . 4 ⊢ (𝑥 = 𝐵 → (𝐴 ∈ 𝑥 ↔ 𝐴 ∈ 𝐵))
14		suceq 4542	. . . . 5 ⊢ (𝑥 = 𝐵 → suc 𝑥 = suc 𝐵)
15	14	eleq2d 2308	. . . 4 ⊢ (𝑥 = 𝐵 → (suc 𝐴 ∈ suc 𝑥 ↔ suc 𝐴 ∈ suc 𝐵))
16	13, 15	imbi12d 234	. . 3 ⊢ (𝑥 = 𝐵 → ((𝐴 ∈ 𝑥 → suc 𝐴 ∈ suc 𝑥) ↔ (𝐴 ∈ 𝐵 → suc 𝐴 ∈ suc 𝐵)))
17		noel 3525	. . . 4 ⊢ ¬ 𝐴 ∈ ∅
18	17	pm2.21i 655	. . 3 ⊢ (𝐴 ∈ ∅ → suc 𝐴 ∈ suc ∅)
19		elsuci 4543	. . . . . . . 8 ⊢ (𝐴 ∈ suc 𝑦 → (𝐴 ∈ 𝑦 ∨ 𝐴 = 𝑦))
20	19	adantl 277	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑦 → suc 𝐴 ∈ suc 𝑦) ∧ 𝐴 ∈ suc 𝑦) → (𝐴 ∈ 𝑦 ∨ 𝐴 = 𝑦))
21		simpl 109	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑦 → suc 𝐴 ∈ suc 𝑦) ∧ 𝐴 ∈ suc 𝑦) → (𝐴 ∈ 𝑦 → suc 𝐴 ∈ suc 𝑦))
22		suceq 4542	. . . . . . . . 9 ⊢ (𝐴 = 𝑦 → suc 𝐴 = suc 𝑦)
23	22	a1i 9	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑦 → suc 𝐴 ∈ suc 𝑦) ∧ 𝐴 ∈ suc 𝑦) → (𝐴 = 𝑦 → suc 𝐴 = suc 𝑦))
24	21, 23	orim12d 798	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑦 → suc 𝐴 ∈ suc 𝑦) ∧ 𝐴 ∈ suc 𝑦) → ((𝐴 ∈ 𝑦 ∨ 𝐴 = 𝑦) → (suc 𝐴 ∈ suc 𝑦 ∨ suc 𝐴 = suc 𝑦)))
25	20, 24	mpd 13	. . . . . 6 ⊢ (((𝐴 ∈ 𝑦 → suc 𝐴 ∈ suc 𝑦) ∧ 𝐴 ∈ suc 𝑦) → (suc 𝐴 ∈ suc 𝑦 ∨ suc 𝐴 = suc 𝑦))
26		vex 2824	. . . . . . . 8 ⊢ 𝑦 ∈ V
27	26	sucex 4641	. . . . . . 7 ⊢ suc 𝑦 ∈ V
28	27	elsuc2 4547	. . . . . 6 ⊢ (suc 𝐴 ∈ suc suc 𝑦 ↔ (suc 𝐴 ∈ suc 𝑦 ∨ suc 𝐴 = suc 𝑦))
29	25, 28	sylibr 134	. . . . 5 ⊢ (((𝐴 ∈ 𝑦 → suc 𝐴 ∈ suc 𝑦) ∧ 𝐴 ∈ suc 𝑦) → suc 𝐴 ∈ suc suc 𝑦)
30	29	ex 115	. . . 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 4742	. 2 ⊢ (𝐵 ∈ ω → (𝐴 ∈ 𝐵 → suc 𝐴 ∈ suc 𝐵))
33		nnon 4752	. . 3 ⊢ (𝐵 ∈ ω → 𝐵 ∈ On)
34		onsucelsucr 4650	. . 3 ⊢ (𝐵 ∈ On → (suc 𝐴 ∈ suc 𝐵 → 𝐴 ∈ 𝐵))
35	33, 34	syl 14	. 2 ⊢ (𝐵 ∈ ω → (suc 𝐴 ∈ suc 𝐵 → 𝐴 ∈ 𝐵))
36	32, 35	impbid 129	1 ⊢ (𝐵 ∈ ω → (𝐴 ∈ 𝐵 ↔ suc 𝐴 ∈ suc 𝐵))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 720   = wceq 1402   ∈ wcel 2209  ∅c0 3520  Oncon0 4503  suc csuc 4505  ωcom 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-14 2212  ax-ext 2220  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-iinf 4730

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-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-uni 3931  df-int 3966  df-tr 4225  df-iord 4506  df-on 4508  df-suc 4511  df-iom 4733

This theorem is referenced by:  nnsucsssuc  6755  nntri3or  6756  nnsucuniel  6758  nnaordi  6771  ennnfonelemhom  13284