Theorem dfsuccl4 39012

Description: Alternate definition that incorporates the most desirable properties of the successor class. (Contributed by Peter Mazsa, 30-Jan-2026.)

Assertion

Ref	Expression
dfsuccl4	⊢ Suc = {𝑛 ∣ ∃!𝑚 ∈ 𝑛 (𝑚 ⊆ 𝑛 ∧ suc 𝑚 = 𝑛)}

Distinct variable group:   𝑚,𝑛

Proof of Theorem dfsuccl4

Step	Hyp	Ref	Expression
1		dfsuccl3 39011	. 2 ⊢ Suc = {𝑛 ∣ ∃!𝑚 suc 𝑚 = 𝑛}
2		sucidg 6445	. . . . . . . . . 10 ⊢ (𝑚 ∈ V → 𝑚 ∈ suc 𝑚)
3	2	elv 3468	. . . . . . . . 9 ⊢ 𝑚 ∈ suc 𝑚
4		eleq2 2858	. . . . . . . . 9 ⊢ (suc 𝑚 = 𝑛 → (𝑚 ∈ suc 𝑚 ↔ 𝑚 ∈ 𝑛))
5	3, 4	mpbii 236	. . . . . . . 8 ⊢ (suc 𝑚 = 𝑛 → 𝑚 ∈ 𝑛)
6		sssucid 6444	. . . . . . . . 9 ⊢ 𝑚 ⊆ suc 𝑚
7		sseq2 3971	. . . . . . . . 9 ⊢ (suc 𝑚 = 𝑛 → (𝑚 ⊆ suc 𝑚 ↔ 𝑚 ⊆ 𝑛))
8	6, 7	mpbii 236	. . . . . . . 8 ⊢ (suc 𝑚 = 𝑛 → 𝑚 ⊆ 𝑛)
9	5, 8	jca 520	. . . . . . 7 ⊢ (suc 𝑚 = 𝑛 → (𝑚 ∈ 𝑛 ∧ 𝑚 ⊆ 𝑛))
10	9	pm4.71ri 569	. . . . . 6 ⊢ (suc 𝑚 = 𝑛 ↔ ((𝑚 ∈ 𝑛 ∧ 𝑚 ⊆ 𝑛) ∧ suc 𝑚 = 𝑛))
11		df-3an 1103	. . . . . 6 ⊢ ((𝑚 ∈ 𝑛 ∧ 𝑚 ⊆ 𝑛 ∧ suc 𝑚 = 𝑛) ↔ ((𝑚 ∈ 𝑛 ∧ 𝑚 ⊆ 𝑛) ∧ suc 𝑚 = 𝑛))
12		3anass 1109	. . . . . 6 ⊢ ((𝑚 ∈ 𝑛 ∧ 𝑚 ⊆ 𝑛 ∧ suc 𝑚 = 𝑛) ↔ (𝑚 ∈ 𝑛 ∧ (𝑚 ⊆ 𝑛 ∧ suc 𝑚 = 𝑛)))
13	10, 11, 12	3bitr2i 302	. . . . 5 ⊢ (suc 𝑚 = 𝑛 ↔ (𝑚 ∈ 𝑛 ∧ (𝑚 ⊆ 𝑛 ∧ suc 𝑚 = 𝑛)))
14	13	eubii 2619	. . . 4 ⊢ (∃!𝑚 suc 𝑚 = 𝑛 ↔ ∃!𝑚(𝑚 ∈ 𝑛 ∧ (𝑚 ⊆ 𝑛 ∧ suc 𝑚 = 𝑛)))
15		df-reu 3377	. . . 4 ⊢ (∃!𝑚 ∈ 𝑛 (𝑚 ⊆ 𝑛 ∧ suc 𝑚 = 𝑛) ↔ ∃!𝑚(𝑚 ∈ 𝑛 ∧ (𝑚 ⊆ 𝑛 ∧ suc 𝑚 = 𝑛)))
16	14, 15	bitr4i 281	. . 3 ⊢ (∃!𝑚 suc 𝑚 = 𝑛 ↔ ∃!𝑚 ∈ 𝑛 (𝑚 ⊆ 𝑛 ∧ suc 𝑚 = 𝑛))
17	16	abbii 2836	. 2 ⊢ {𝑛 ∣ ∃!𝑚 suc 𝑚 = 𝑛} = {𝑛 ∣ ∃!𝑚 ∈ 𝑛 (𝑚 ⊆ 𝑛 ∧ suc 𝑚 = 𝑛)}
18	1, 17	eqtri 2792	1 ⊢ Suc = {𝑛 ∣ ∃!𝑚 ∈ 𝑛 (𝑚 ⊆ 𝑛 ∧ suc 𝑚 = 𝑛)}

Syntax hints:   ∧ wa 400   ∧ w3a 1101   = wceq 1567   ∈ wcel 2149  ∃!weu 2602  {cab 2747  ∃!wreu 3374  Vcvv 3463   ⊆ wss 3913  suc csuc 6363   Suc csuccl 38717

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-pr 5405  ax-un 7733  ax-reg 9553

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-reu 3377  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-opab 5178  df-eprel 5562  df-fr 5615  df-cnv 5670  df-dm 5672  df-rn 5673  df-suc 6367  df-sucmap 39000  df-succl 39007

This theorem is referenced by: (None)