Proof of infimum of a convex function being convex

Question

In Boyd's convex optimization book, he gave this proof. I'm not sure how did he claim that

$f(x_i, y_i) \leq g(x_i) + \epsilon$

And how does it relate to Jensen's Inequality.