Greedy Algorithm yields Maximal Set

Theorem
Let $S$ be a finitie set.

Let $\mathscr F$ be a hereditary set of subsets.

Let $w : S \to \R_{\ge 0}$ be a weight function.

Then the Greedy Algorithm selects a maximal set $A_0$ in $\mathscr F$.