Proof in Linear Programming - extreme point

Can anyone help me to prove this? I'm really stuck with geometry in Linear Programming...

(See attached file for full problem description and equations)

Assume P is a polyhedron and H is a supporting hyperplane to P.
Prove that is an extreme point of if and only if is an extreme point of P.