For a transferable utility game the convex hull of the Weber allocations contains the core as a subset. A proof of this result normally involves an induction hypothesis to the number of players. We will give here a short proof based on a well known result in convex analysis.