Theorem: N.f_succ (LeanTeaching/TD/TD02_sol.lean)

State before:
S : Type
image_zero : S
image_succ : N → S → S
n : N
⊢ recursion S image_zero image_succ (succ n) = image_succ n (recursion S image_zero image_succ n)
Tactic:
rfl
State after:
no goals