We can use structural induction to give a careful proof that any term we can build using only the function symbol $<-,-,->$ and the variable symbol $x$ represents either the identity function or the constant $0$ function.
Base case $x$: Upon substituting $1$ for $x$, we get $1$. Upon substituting $0$, we get $0$. Therefore $x$ represents the identity function.
Inductive case: Consider a term $f(x)$ form $<A(x),B(x),C(x)>$, where we know by inductive assumption that each of $A(x)$, $B(x)$ and $C(x)$ represents either the identity function or the constant 0 function.
We perform a case analysis, tabulating each of these eight possibilities:
A(x) | B(x) | C(x) | x | f(x)
-----|------|------|---|-----
x | x | x | 1 | 0
| | | 0 | 0 (const. 0)
-----|------|------|---|-----
x | x | 0 | 1 | 0
| | | 0 | 0 (const. 0)
-----|------|------|---|-----
x | 0 | x | 1 | 0
| | | 0 | 0 (const. 0)
-----|------|------|---|-----
x | 0 | 0 | 1 | 1
| | | 0 | 0 (identity)
-----|------|------|---|-----
0 | x | x | 1 | 1
| | | 0 | 0 (identity)
-----|------|------|---|-----
0 | x | 0 | 1 | 0
| | | 0 | 0 (const. 0)
-----|------|------|---|-----
0 | 0 | x | 1 | 0
| | | 0 | 0 (const. 0)
-----|------|------|---|-----
0 | 0 | 0 | 1 | 0
| | | 0 | 0 (const. 0)
We see that in each of these cases, $<A(x),B(x),C(x)>$ represents either the identity function or the constant $0$ function. By the principle of structural induction, any term built using only the function symbol $<-,-,->$ and the variable symbol $x$ represents either the identity function or the constant $0$ function.
Consequently, we cannot express negation or the constant $1$ function using only $<-,-,->$, and so the set $\{ <-,-,-> \}$ is not functionally complete.