A Combinatorial Identity for Rooted Labelled Forests

In this brief note a purely combinatorial proof for an identity related to rooted forests and unordered set partitions is provided. Furthermore, references that put this type of identity in the context of forest volumes are given.