A large deviation theory proof of the abstract alphabet source coding theorem

A modified proof of T. Berger's (1971) abstract alphabet source coding with a fidelity criterion theorem is provided, utilizing a variant of a result from large deviation theory. This proof does not use an asymptotic equipartition property of any kind, thus providing what appears to be a more direct approach to this key result.<
>