This is usually shown by an application of the Statistical No Free Lunch Theorem.
But is this possible to show this by working simply with the definition of PAC learnability and the sample complexity VC bound.
In particular if it's PAC learnable we know that for any $\epsilon$ and $\delta$ we have a sample complexity VC lower bound $m(\epsilon, \delta)$ such that if we have $m > m(\epsilon, \delta)$ samples we get a $L_D(A(S)) <\epsilon$, where $m(\epsilon,\delta)=\Theta(\frac{VC}{\epsilon^2})$. Thus with an infinite VC dimension the sample complexity lower bound tends to infinity, meaning that we won't be able to learn assuming a non-infinite sample of data.
Are there any issues with this argument that infinite VC dimension of a hypothesis class implies that the hypothesis class is not PAC learnable?