This work provides necessary and sufficient conditions for the dominance solvability of approval voting games. Our conditions are very simple since they are based on the approval relation, a binary relation between the alternatives. We distinguish between two sorts of dominance solvability and prove that the most stringent one leads to the election of the set of Condorcet Winners whereas this need not be the case for the weak version.