There are facts in Mathematics that are so "obvious" and "well-known" that no-one includes a proper proof. An example is:

Theorem: If polynomial $P(x,y)$ with rational coefficients is irreducible over ${\mathbb Q}$ but not absolutely irreducible, then the equation $P(x,y)=0$ has at most finitely many rational solutions, and there is an algorithm for listing them all.

This theorem is very important and used (explicitly or implicitly) in hundreds of papers and books devoted to study rational points on curves $P(x,y)=0$, because it allows to assume without loss of generality that $P(x,y)$ is absolutely irreducible, define genus, and proceed in standard way. However, I am not able to find the full proof with all details. At best, there are short sentences like

"In this case all rational points are singular and the statement follows from Bézout's Theorem"

or

"If it not absolutely irreducible, then the absolute factors are conjugate, so any rational solution to one of them satisfies them all, so one can solve the system to find the finitely many rational points and check whether any of them are integer points."

or

"if $P(x,y)$ is irreducible over ${\mathbb Q}$ but not absolutely irreducible then the action of Galois acts transitively on the Q-irreducible components, but rational points are fixed by Galois, so X(Q) is contained in the intersection of the Q-irreducible components; thus in this case we reduce to the 0-dimensional problem."

However, I cannot find anywhere a proper proof with all details and with definitions of all concepts involved. Why exactly all rational points are singular? Bézout's Theorem is the statement about finiteness but not about algorithm for computing all points. What exactly is meant by "factors are conjugate" or "action of Galois acts transitively", and why this is true?

So, the question is to present a more detailed proof of this theorem or point me to a reference with a proper detailed proof.