Definition df-sucmap 39111

Description: Define the successor map, directly as the graph of the successor operation, using only elementary set theory (ordered-pair class abstraction). This avoids committing to any particular construction of the successor function/class from other operators (e.g. a union/composition presentation), while remaining provably equivalent to those presentations (cf. dfsucmap2 39113 and dfsucmap3 39112 vs. df-succf 36362 and dfsuccf2 36433). For maximum mappy shape, see dfsucmap4 39114.

We also treat the successor relation as the default shift relation for grading/tower arguments (cf. df-shiftstable 39131). Because it is used pervasively in shift-lift infrastructure, we adopt the short name SucMap rather than the fully systematic "SucAdjLiftMap".

You may also define the predecessor relation as the converse graph "PreMap" as ^◡ SucMap, which reverses successor edges ( cf. cnvopab 6137) and sends each successor to its (unique) predecessor when it exists. (Contributed by Peter Mazsa, 25-Jan-2026.)

Assertion

Ref	Expression
df-sucmap	⊢ SucMap = {⟨𝑚, 𝑛⟩ ∣ suc 𝑚 = 𝑛}

Distinct variable group:   𝑚,𝑛

Detailed syntax breakdown of Definition df-sucmap

Step	Hyp	Ref	Expression
1		csucmap 38827	. 2 class SucMap
2		vm	. . . . . 6 setvar 𝑚
3	2	cv 1569	. . . . 5 class 𝑚
4	3	csuc 6362	. . . 4 class suc 𝑚
5		vn	. . . . 5 setvar 𝑛
6	5	cv 1569	. . . 4 class 𝑛
7	4, 6	wceq 1570	. . 3 wff suc 𝑚 = 𝑛
8	7, 2, 5	copab 5173	. 2 class {⟨𝑚, 𝑛⟩ ∣ suc 𝑚 = 𝑛}
9	1, 8	wceq 1570	1 wff SucMap = {⟨𝑚, 𝑛⟩ ∣ suc 𝑚 = 𝑛}

This definition is referenced by:  dfsucmap3  39112  dfsucmap4  39114  brsucmap  39115  relsucmap  39116  dfsuccl2  39119