Lemma in text: Let $c$ be a constant and $L = \{1^c\}$ (the singleton language containing the string of $c$ many 1's). Then no DFA with < $c$ states can accept $L$.
The given proof assumes $\exists$ a DFA, $M$, with < $c$ states that accepts $L$ and ends with a contradiction showing how $M$ must accept infinitely more inputs than $\{1^c\}$.
I was wondering how the conclusion that $M$ accepts more inputs than those in $L$ implies $M$ cannot exist. Can a DFA not accept/recognize more than one language by design?