Theorem dfsuccl4 39123

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 39122	. 2 ⊢ Suc = {𝑛 ∣ ∃!𝑚 suc 𝑚 = 𝑛}
2		sucidg 6444	. . . . . . . . . 10 ⊢ (𝑚 ∈ V → 𝑚 ∈ suc 𝑚)
3	2	elv 3460	. . . . . . . . 9 ⊢ 𝑚 ∈ suc 𝑚
4		eleq2 2852	. . . . . . . . 9 ⊢ (suc 𝑚 = 𝑛 → (𝑚 ∈ suc 𝑚 ↔ 𝑚 ∈ 𝑛))
5	3, 4	mpbii 236	. . . . . . . 8 ⊢ (suc 𝑚 = 𝑛 → 𝑚 ∈ 𝑛)
6		sssucid 6443	. . . . . . . . 9 ⊢ 𝑚 ⊆ suc 𝑚
7		sseq2 3963	. . . . . . . . 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 1105	. . . . . 6 ⊢ ((𝑚 ∈ 𝑛 ∧ 𝑚 ⊆ 𝑛 ∧ suc 𝑚 = 𝑛) ↔ ((𝑚 ∈ 𝑛 ∧ 𝑚 ⊆ 𝑛) ∧ suc 𝑚 = 𝑛))
12		3anass 1111	. . . . . 6 ⊢ ((𝑚 ∈ 𝑛 ∧ 𝑚 ⊆ 𝑛 ∧ suc 𝑚 = 𝑛) ↔ (𝑚 ∈ 𝑛 ∧ (𝑚 ⊆ 𝑛 ∧ suc 𝑚 = 𝑛)))
13	10, 11, 12	3bitr2i 302	. . . . 5 ⊢ (suc 𝑚 = 𝑛 ↔ (𝑚 ∈ 𝑛 ∧ (𝑚 ⊆ 𝑛 ∧ suc 𝑚 = 𝑛)))
14	13	eubii 2613	. . . 4 ⊢ (∃!𝑚 suc 𝑚 = 𝑛 ↔ ∃!𝑚(𝑚 ∈ 𝑛 ∧ (𝑚 ⊆ 𝑛 ∧ suc 𝑚 = 𝑛)))
15		df-reu 3370	. . . 4 ⊢ (∃!𝑚 ∈ 𝑛 (𝑚 ⊆ 𝑛 ∧ suc 𝑚 = 𝑛) ↔ ∃!𝑚(𝑚 ∈ 𝑛 ∧ (𝑚 ⊆ 𝑛 ∧ suc 𝑚 = 𝑛)))
16	14, 15	bitr4i 281	. . 3 ⊢ (∃!𝑚 suc 𝑚 = 𝑛 ↔ ∃!𝑚 ∈ 𝑛 (𝑚 ⊆ 𝑛 ∧ suc 𝑚 = 𝑛))
17	16	abbii 2830	. 2 ⊢ {𝑛 ∣ ∃!𝑚 suc 𝑚 = 𝑛} = {𝑛 ∣ ∃!𝑚 ∈ 𝑛 (𝑚 ⊆ 𝑛 ∧ suc 𝑚 = 𝑛)}
18	1, 17	eqtri 2786	1 ⊢ Suc = {𝑛 ∣ ∃!𝑚 ∈ 𝑛 (𝑚 ⊆ 𝑛 ∧ suc 𝑚 = 𝑛)}

Syntax hints:   ∧ wa 400   ∧ w3a 1103   = wceq 1570   ∈ wcel 2143  ∃!weu 2596  {cab 2741  ∃!wreu 3367  Vcvv 3455   ⊆ wss 3905  suc csuc 6362   Suc csuccl 38828

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-pr 5404  ax-un 7732  ax-reg 9550

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-eprel 5561  df-fr 5614  df-cnv 5669  df-dm 5671  df-rn 5672  df-suc 6366  df-sucmap 39111  df-succl 39118

This theorem is referenced by: (None)