Independent Subset is Contained in Maximal Independent Subset

Theorem
Let $M = \struct{S, \mathscr I}$ be a matroid.

Let $A \subseteq S$.

Let $X \in \mathscr I$ such that $X \subseteq A$.

Let $\size X < \map \rho A$, where $\rho$ is the rank function on $M$.

Then:
 * $\exists Y \in \mathscr I : X \subseteq Y \subseteq A : \size Y = \map \rho A$

Proof
By definition of the rank function on $M$:
 * $\map \rho A = \max \set{\size I : I \subseteq A \land I \in \mathscr I}$

From Max Equals an Operand:
 * $\exists Z \in \mathscr I : Z \subseteq A$ and $\size Z = \map \rho A$

From Independent Set can be Augmented by Larger Independent Set:
 * $\exists Y' \subseteq Z \setminus X: \size {X \cup Y'} = \size Z$ and $X \cup Y' \in \mathscr I$

We have:

From Union of Subsets is Subset:
 * $X \cup Y' \subseteq A$

Let $Y = X \cup Y'$ and the result follows.