If a bipartite graph \(G = \{A, B\}\) has a matching of \(A\text{,}\) then
for all \(S \subseteq A\text{.}\)