Proof step

Ore-algebra identity of two definitions

All-n equality of two definitions

Concludes

shift_x_plus_one of Triangular array of the number of binary, rooted, leaf-labeled tree topologies with n leaves and k cherries, n >= 2, 1 <= k <= floor(n/2).

Premises

none: a direct theorem check

Theorem

polytool ?

Checked

polytool replayed · Lean not attempted