G = (V, E) is a graph, k < ω, and every finite subgraph of G has chromatic number ≤ k. Then Chr(G) ≤ k. Proof. Let Pω(V) denote the set of finite subsets of V. For each x ∈ Pω(V), let Gx = (x, E ∩ [x]2) be the induced subgraph on x, and let cx : x → k witness that Chr(Gx ) ≤ k. Let U be a fine ultrafilter over Pω(V), i.e., an ultrafilter such that, for all u ∈ V, Zu := {x ∈ Pω(V) | u ∈ x} ∈ U. For each u ∈ V, fix mu < k such that {y ∈ Zu | cy (u) = mu} ∈ U. Define c : V → k by letting c(u) = mu for all u ∈ V.