I thought to solve this problem as follows:
$P_{atLeast} = P_{AceFirstOnly} + P_{AceSecondOnly} + P_{BothAces}$
The actual solution:
$P_{atLeast} = P_{AceFirst} + P_{AceSecond} - P_{BothAces}$
Why is my approach wrong and the solution correct.
My equation considers the appropriate cases without, more importantly, letting one case partially coincide with another.
My thoughts on the solution? When you enumerate all hands with an ace first, those hands also include aces occurring second. We shouldn't add $P_{AceSecond}$, as a result.
EDIT: I have included below what I think the resolution is as to why the solution doesn't overcount.
The following arrangements and their permutations represent the hands involving two aces from $P_{AceFirst}$ alone. The trick here is to realize that the 12 arrangements already already take double aces into account. If we then add $P_{AceSecond}$ to $P_{AceFirst}$, $P_{AceSecond}$, we will again take double aces into account. As a result, we must subtract this "double consideration" by subtracting $P_{BothAces}$ from the foregoing expression.
\begin{matrix} A_{1}A_{2} & A_{2}A_{3} \\ A_{1}A_{3} & A_{2}A_{4} \\ A_{1}A_{4} & A_{3}A_{4} \end{matrix}
and their permutations.
Your answer is correct, because $P_{AceFirstOnly}=P_{AceFirst}-P_{BothAces}$.