Greedy Algorithm yields Maximal Set

Theorem
Let $\struct{S,\mathscr F}$ be an independence system.

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

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