I see (at least) two methods for proving the universally-quantified statement $$\forall a{\in} D~\big(P(x)\rightarrow Q(x)\big).$$
(1) Method 1
Let $a$ in $D$ (or, Let $a$ be any element in $D$).
$\cdots\cdots$ (some arguments)
$\therefore P(a)\rightarrow Q(a).$
Since we have made no special assumption on $a$, $P(a)\rightarrow Q(a)$ holds true for any $a$ in $D.$ Thus, we have shown that $\forall a{\in} D~\big(P(x)\rightarrow Q(x)\big).$
(2) Method 2
Arbitrary choose $a$ in $D.$
$\cdots\cdots$ (some arguments)
$\therefore P(a)\rightarrow Q(a)$
Since $a$ was arbitrarily chosen, $P(a)\rightarrow Q(a)$ holds true for any $a$ in $D.$ Thus, we have shown that $\forall a{\in} D~\big(P(x)\rightarrow Q(x)\big).$
Which formulation is more proper, logical and better structured? I think that Method 1 is an exact application of the Universal Generalisation rule, while Method 2 is somewhat not clear. Yes, we had indeed arbitrary chosen a element $a$ in $D,$ but someone may argue that "hey, it is because you're lucky that you randomly chose the right $a$ at the very beginning that makes the predicate true in the set! If you want to show that this is true for any element in the set, you should not have used the word choose in the proof's beginning, or, at least, you should say at the end that since our intermediate steps do not use the special assumption of $a,$ it suits for all elements. But in this way, this becomes slightly complex than Method 1, why not just use Method 1?" The reason that Method 2 is valid is somewhat of a meta-level, not indicate by the language itself.