There could not be an edge from u to v in a DAG, if w is before v in a topological order

Question

I am trying to prove that given a DAG. There exists a valid topological ordering that has v in front of u iff there is no path from u to v. The proof is related to the fact that reverse DFS post visit order satisfies the condition of topological order. How do I construct a proof?