Theorem dfsucon 41028

Description: 𝐴 is called a successor ordinal if it is not a limit ordinal and not the empty set. (Contributed by RP, 11-Nov-2023.)

Assertion

Ref	Expression
dfsucon	⊢ ((Ord 𝐴 ∧ ¬ Lim 𝐴 ∧ 𝐴 ≠ ∅) ↔ ∃𝑥 ∈ On 𝐴 = suc 𝑥)

Distinct variable group:   𝑥,𝐴

Proof of Theorem dfsucon

Step	Hyp	Ref	Expression
1		3ancomb 1097	. . . 4 ⊢ ((Ord 𝐴 ∧ ¬ Lim 𝐴 ∧ 𝐴 ≠ ∅) ↔ (Ord 𝐴 ∧ 𝐴 ≠ ∅ ∧ ¬ Lim 𝐴))
2		df-3an 1087	. . . 4 ⊢ ((Ord 𝐴 ∧ 𝐴 ≠ ∅ ∧ ¬ Lim 𝐴) ↔ ((Ord 𝐴 ∧ 𝐴 ≠ ∅) ∧ ¬ Lim 𝐴))
3		df-ne 2943	. . . . . . . . 9 ⊢ (𝐴 ≠ ∅ ↔ ¬ 𝐴 = ∅)
4	3	anbi2i 622	. . . . . . . 8 ⊢ ((Ord 𝐴 ∧ 𝐴 ≠ ∅) ↔ (Ord 𝐴 ∧ ¬ 𝐴 = ∅))
5	4	imbi1i 349	. . . . . . 7 ⊢ (((Ord 𝐴 ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ On 𝐴 = suc 𝑥) ↔ ((Ord 𝐴 ∧ ¬ 𝐴 = ∅) → ∃𝑥 ∈ On 𝐴 = suc 𝑥))
6		pm5.6 998	. . . . . . 7 ⊢ (((Ord 𝐴 ∧ ¬ 𝐴 = ∅) → ∃𝑥 ∈ On 𝐴 = suc 𝑥) ↔ (Ord 𝐴 → (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥)))
7		iman 401	. . . . . . 7 ⊢ ((Ord 𝐴 → (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥)) ↔ ¬ (Ord 𝐴 ∧ ¬ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥)))
8	5, 6, 7	3bitrri 297	. . . . . 6 ⊢ (¬ (Ord 𝐴 ∧ ¬ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥)) ↔ ((Ord 𝐴 ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ On 𝐴 = suc 𝑥))
9		dflim3 7669	. . . . . 6 ⊢ (Lim 𝐴 ↔ (Ord 𝐴 ∧ ¬ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥)))
10	8, 9	xchnxbir 332	. . . . 5 ⊢ (¬ Lim 𝐴 ↔ ((Ord 𝐴 ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ On 𝐴 = suc 𝑥))
11	10	anbi2i 622	. . . 4 ⊢ (((Ord 𝐴 ∧ 𝐴 ≠ ∅) ∧ ¬ Lim 𝐴) ↔ ((Ord 𝐴 ∧ 𝐴 ≠ ∅) ∧ ((Ord 𝐴 ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ On 𝐴 = suc 𝑥)))
12	1, 2, 11	3bitri 296	. . 3 ⊢ ((Ord 𝐴 ∧ ¬ Lim 𝐴 ∧ 𝐴 ≠ ∅) ↔ ((Ord 𝐴 ∧ 𝐴 ≠ ∅) ∧ ((Ord 𝐴 ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ On 𝐴 = suc 𝑥)))
13		pm3.35 799	. . 3 ⊢ (((Ord 𝐴 ∧ 𝐴 ≠ ∅) ∧ ((Ord 𝐴 ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ On 𝐴 = suc 𝑥)) → ∃𝑥 ∈ On 𝐴 = suc 𝑥)
14	12, 13	sylbi 216	. 2 ⊢ ((Ord 𝐴 ∧ ¬ Lim 𝐴 ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ On 𝐴 = suc 𝑥)
15		eloni 6261	. . . . . 6 ⊢ (𝑥 ∈ On → Ord 𝑥)
16		ordsuc 7636	. . . . . 6 ⊢ (Ord 𝑥 ↔ Ord suc 𝑥)
17	15, 16	sylib 217	. . . . 5 ⊢ (𝑥 ∈ On → Ord suc 𝑥)
18		nlimsucg 7664	. . . . 5 ⊢ (𝑥 ∈ On → ¬ Lim suc 𝑥)
19		nsuceq0 6331	. . . . . 6 ⊢ suc 𝑥 ≠ ∅
20	19	a1i 11	. . . . 5 ⊢ (𝑥 ∈ On → suc 𝑥 ≠ ∅)
21	17, 18, 20	3jca 1126	. . . 4 ⊢ (𝑥 ∈ On → (Ord suc 𝑥 ∧ ¬ Lim suc 𝑥 ∧ suc 𝑥 ≠ ∅))
22		ordeq 6258	. . . . 5 ⊢ (𝐴 = suc 𝑥 → (Ord 𝐴 ↔ Ord suc 𝑥))
23		limeq 6263	. . . . . 6 ⊢ (𝐴 = suc 𝑥 → (Lim 𝐴 ↔ Lim suc 𝑥))
24	23	notbid 317	. . . . 5 ⊢ (𝐴 = suc 𝑥 → (¬ Lim 𝐴 ↔ ¬ Lim suc 𝑥))
25		neeq1 3005	. . . . 5 ⊢ (𝐴 = suc 𝑥 → (𝐴 ≠ ∅ ↔ suc 𝑥 ≠ ∅))
26	22, 24, 25	3anbi123d 1434	. . . 4 ⊢ (𝐴 = suc 𝑥 → ((Ord 𝐴 ∧ ¬ Lim 𝐴 ∧ 𝐴 ≠ ∅) ↔ (Ord suc 𝑥 ∧ ¬ Lim suc 𝑥 ∧ suc 𝑥 ≠ ∅)))
27	21, 26	syl5ibrcom 246	. . 3 ⊢ (𝑥 ∈ On → (𝐴 = suc 𝑥 → (Ord 𝐴 ∧ ¬ Lim 𝐴 ∧ 𝐴 ≠ ∅)))
28	27	rexlimiv 3208	. 2 ⊢ (∃𝑥 ∈ On 𝐴 = suc 𝑥 → (Ord 𝐴 ∧ ¬ Lim 𝐴 ∧ 𝐴 ≠ ∅))
29	14, 28	impbii 208	1 ⊢ ((Ord 𝐴 ∧ ¬ Lim 𝐴 ∧ 𝐴 ≠ ∅) ↔ ∃𝑥 ∈ On 𝐴 = suc 𝑥)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 395   ∨ wo 843   ∧ w3a 1085   = wceq 1539   ∈ wcel 2108   ≠ wne 2942  ∃wrex 3064  ∅c0 4253  Ord word 6250  Oncon0 6251  Lim wlim 6252  suc csuc 6253

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-11 2156  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347  ax-un 7566

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-tr 5188  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257

This theorem is referenced by: (None)