Theorem - All DFAs have an equivalent NFA

Statement

Every Deterministic Finite Automaton has an equivalent Nondeterministic Finite Automaton.

Proof

The proof is that, by definition: every DFA is also an NFA. It just so happens that DFAs do not make use of the extra “power” or flexibility of NFAs