| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > df-succl | Structured version Visualization version GIF version | ||
| Description: Define Suc as the class of all successors, i.e. the range of the successor map: 𝑛 ∈ Suc iff ∃𝑚suc 𝑚 = 𝑛 (see dfsuccl2 39008). By injectivity of suc (suc11reg 9587), every 𝑛 ∈ Suc has at most one predecessor, which is exactly what pre 𝑛 (df-pre 39013) names. Cf. dfsuccl3 39011 and dfsuccl4 39012. (Contributed by Peter Mazsa, 25-Jan-2026.) |
| Ref | Expression |
|---|---|
| df-succl | ⊢ Suc = ran SucMap |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | csuccl 38717 | . 2 class Suc | |
| 2 | csucmap 38716 | . . 3 class SucMap | |
| 3 | 2 | crn 5663 | . 2 class ran SucMap |
| 4 | 1, 3 | wceq 1567 | 1 wff Suc = ran SucMap |
| Colors of variables: wff setvar class |
| This definition is referenced by: dfsuccl2 39008 eupre 39032 sucpre 39035 presuc 39036 |
| Copyright terms: Public domain | W3C validator |