I want to prove that some functions are not one-to-one.
Are both these proofs written correct?
$\exists\,x_1=1,\,x_2=-1\;[1\neq -1 \wedge f(1)=f(-1)]$
$\exists\,x_1=1,\,x_2=-1\;[x_1\neq x_2 \wedge f(x_1)=f(x_2)]$
I want to prove that some functions are not one-to-one.
Are both these proofs written correct?
$\exists\,x_1=1,\,x_2=-1\;[1\neq -1 \wedge f(1)=f(-1)]$
$\exists\,x_1=1,\,x_2=-1\;[x_1\neq x_2 \wedge f(x_1)=f(x_2)]$
I have never seen the notation $\exists_{x_1=1}$. It is clear what you mean, but unless you are following the notation of your instructor it would be best to avoid this.
I would personally suggest just saying
Since $f(-1) = f(1)$ we can see that $f$ is not one-to-one.
If you wanted to be extremely formal you could say something like:
A function $f:X \to Y$is said to be one to one if $$\forall x_1 \in X \forall x_2 \in X f(x_1) = f(x_2) \implies x_1 = x_2$$ We want to show that our particular $f$ is not one-to-one. Assume $f$ is one-to-one. Notice that $f(-1) = f(1)$ for our particular $f$. So if $f$ were one-to-one we would have that $-1=1$, which is absurd. Thus $f$ is not one-to-one.