I am having some difficulties answering this question:
For some fixed $x_0,x_1,y_0,$ and $y_1$ in $\mathbb R$, where the ordered pairs $(x_0,y_0) \neq (x_1,y_1)$,prove that the following sets have an intersection of precisely one element:
$S_1=\left\{(x,y) \in \mathbb R \times \mathbb R: \sqrt{(x-x_1)^2+(y-y_1)^2}=\sqrt{(x_1-x_0)^2+(y_1-y_0)^2} \right\}$
$S_2=\left\{(x,y) \in \mathbb R \times \mathbb R: \sqrt{\left(x-(2x_1-x_0)\right)^2+\left(y-(2y_1-y_0)\right)^2}=\sqrt{\left(2\cdot(x_1-x_0)\right)^2+\left(2\cdot(y_1-y_0)\right)^2}\right\}$
These sets describe the following picture, where $(x_2,y_2)$ is simply $(2x_1-x_0,2y_1-y_0)$:
Picture of Small Circle Inside a Large Circle Making 1 Point of Contact
The question at hand is equivalently framed as finding the solution to the set of equations:
\begin{align} &(1) \quad \sqrt{(x-x_1)^2+(y-y_1)^2}=\sqrt{(x_1-x_0)^2+(y_1-y_0)^2} \\ &(2)\quad\sqrt{\left(x-(2x_1-x_0)\right)^2+\left(y-(2y_1-y_0)\right)^2}=\sqrt{\left(2\cdot(x_1-x_0)\right)^2+\left(2\cdot(y_1-y_0)\right)^2} \end{align}
If $(x,y)$ satisfies $(1)$ and $(2)$, then we must have $(1')$ and $(2')$:
\begin{align} &(1')\quad(x-x_1)^2+(y-y_1)^2=(x_1-x_0)^2+(y_1-y_0)^2 \\ &(2')\quad\left(x-(2x_1-x_0)\right)^2+\left(y-(2y_1-y_0)\right)^2=\left(2\cdot(x_1-x_0)\right)^2+\left(2\cdot(y_1-y_0)\right)^2 \end{align}
After expanding $(2')$, I was able to find that some portion of the terms on the left side of the equality had the form $(x-x_1)^2+(y-y_1)^2$, so I proceeded to substitute in the right hand side of equation $(1')$. This effectively substitutes a constant in for the quadratic terms $x^2$ and $y^2$, while keeping the $x$ and $y$ terms, which will allow us to implicitly solve for one of the variables. After some additional simplification, I produced the equation:
$$(3) \quad (x-x_1)(x_0-x_1)+(y-y_1)(y_0-y_1)=(x_0-x_1)^2+(y_0-y_1)^2$$
Some additional algebra and factoring leads to the equation that is giving me problems:
$$(4) \quad (x_0-x_1)(x-x_0)+(y_0-y_1)(y-y_0)=0$$
It is easy to see from $(4)$ that $(x_0,y_0)$ is a valid solution (which makes sense from the construction of the sets). However, I am having difficulties showing that $(x_0,y_0)$ is the only valid solution. When we initially assumed that $(x_0,y_0) \neq (x_1,y_1)$, we equivalently have that $x_0 \neq x_1 \text{ OR } y_0\neq y_1$.
Consider the case when $x_0=x_1$ and $y_0 \neq y_1$. From $(4)$, we see that, although we must have $y=y_0$, $x$ can equal any number $\in \mathbb R$. This is a problem if we want to show that only one ordered pair satisfies both equations. A similar complication arises if we assume that $x_0\neq x_1$ and $y_0 = y_1$.
As far as I can tell, all of the algebraic manipulations I made are perfectly reversible. Therefore, if $(x,y)$ satisfies $(4)$, it should also satisfy $(2)$. However, that is clearly not the case. i.e. it is definitely FALSE that $\forall x \in \mathbb R : (x,y_0) \in S_2$.
Where have I gone wrong in the argument?