Proof that a subtree of a red-black tree has no more than $\frac{3n}{4}$ nodes

Question

I have a red-black tree with $n$ nodes, rooted at $x$. How can I prove or disprove that the number of nodes in any subtree of $x$ (including the root of the subtree) will never be greater than $\frac{3n}{4}$?