 Degree-weighted Hall condition

In a finite bipartite graph, suppose every left vertex has positive degree and each edge joins vertices with $d(x)\ge d(y)$ from left to right. Then $|N(A)|\ge {\sum }_{x\in A}{\sum }_{y\sim x}1/d(y)\ge |A|$, so a matching covers the left side.