Unbound value in recursive function (Beginner OCaml)

Question

Code:

let isPrime x =
    let checkZero d = match (x mod d, x mod d + 2, intRoot x < d) with
        | (0,_,_)    -> false
        | (_,0,_)    -> fa