This is for Exercise 2.4.6 of Barengredt's "Lambda Calculus - It's Syntax and Semantics" and the exact statement from the book is to "Show that $\neg \ \exists \ F \ \forall \ MN \ F(MN) = M$".
My solution is as follows, and I was wondering if there is anything wrong with it:
Assume that there were to exist such an $F$. Then, let $G \equiv \lambda x . F(xI)$. So, for any $N$, we have that \begin{align} GN = F(NI) = N \tag{1} \end{align}
But by $\beta$-conversion, $G$ can be re-written as $G \equiv \lambda x.F(xI) = \lambda x.F((\lambda y. yI) x)$. Now, by the Fixed Point Theorem, there is some $X$ that is the fixed point of $\lambda y. yI$, and so $$ GX = F ((\lambda y.yI) X) = FX $$ Now, apply $F$ to both sides: \begin{align} G = F(GX) = F(FX) = F\tag{2} \end{align}
This means that for any $N$, \begin{align*} N \stackrel{(1)}{=} GN = G(IN) \stackrel{(2)}{=} F(IN) = I \end{align*} Now this shows that $F(MN)\ \# \ M$.
(The $I$ above is just the identity function).