Let $P\subseteq \mathbb{R}^n$ be a full dimensional polytope. Let us assume that $P$ has a facet description with the following inequalities: $$ \left<x,u_F\right> \geq -a_F$$ where $u_F\in \mathbb{R}^n$ and $a_F\in \mathbb{R}$ for each facet $F$ of the polytope.
In other words, $P$ is the bounded intersection of the halfspaces $H_{u_F,-a_F}^+$. For each $Q$ face of $P$ we define the cone $$\sigma_Q := \operatorname{Cone}(u_F: F \text{ facet, } F\supseteq Q)$$
What I want is to prove that $$\sigma_Q = \{u\in \mathbb{R}^n : \left<x,u\right> \leq \left<y,u\right> \text{ for all } x\in Q, y\in P\}$$
My thoughts: It is easy to prove one of the inclusions. For the other, I wanted to use (one of the many versions of) Farkas Lemma.
If $u\in \mathbb{R}^n$ satisfies $\left<x,u\right>\leq \left<y,u\right>$ for each $x\in Q$ and $y\in P$, in particular, there exists a face $Q'$ of $P$ such that $Q' = P \cap H_{u,a}$ for certain $a=\left<x,u\right>$ for any $x\in Q$ (this value is independent of $x\in Q$), also $Q\subseteq Q'$ and $P\subseteq H_{u,a}^+$. I tried to use Farkas Lemma II (see Ziegler's book). So, to conclude that $u\in \sigma_Q$, I need to prove that there cannot exist a vector $m\in \mathbb{R}^n$ with the property that: $$\left<m,u_F\right> \geq 0 \text{ for all facets } F\supseteq Q'$$ and simultaneously $$\left<m,u\right> < 0.$$
To get a contradiction I think it suffices to show that one can find a point $x\in P\smallsetminus Q'$ such that $x = q - \lambda m$ for a $q\in Q'$ and $\lambda > 0$.
In that case, $x\in P\smallsetminus Q'$ implies that for some facet $F$ with $F\supseteq Q'$ it has to be: $\left<x,u_F\right> > -a_F$, which yields $\left<q,u_F\right> - \lambda\left<m,u_F\right> > -a_F$. The fact that $q\in Q'$ implies that $\left<q,u_F\right> = -a_F$, from where it follows $\lambda\left<m,u_F\right> < 0$ and $\lambda > 0$ yields $\left<m,u_F\right> < 0$ which is the desired contradiction. I am having trouble to prove the existence of such an $x$.
Of course, a different approach to prove this is also welcome!