A short list color proof of Grِtzschʹs theorem

We give a short proof of the result that every planar graph of girth 5 is 3-choosable and hence also of Grِtzschʹs theorem saying that every planar triangle-free graph is 3-colorable.