English
For any α with a preorder, an OrderBot, an AddMonoidWithOne, and SuccAddOrder, succ_ofNat(n) yields succ of the nat embedding equals nat embedding plus one.
Русский
Для любого α с предorder, OrderBot, AddMonoidWithOne и SuccAddOrder, succ_ofNat(n) даёт результат, что числитель n в WithBot α сдвигается на 1.
LaTeX
$$$$\operatorname{succ}\left(n\right) = n + 1 \quad \text{in } \mathrm{WithBot} \ \alpha,$$$$
Lean4
@[simp]
theorem succ_ofNat (n : ℕ) [n.AtLeastTwo] : succ (ofNat(n) : WithBot α) = ofNat(n) + 1 :=
succ_natCast n