Use the fact that 3-CNF is NP-complete to prove NP-completeness of testing if a linear system of inequality

Use the fact that 3-CNF is NP-complete to prove NP-completeness of testing if a linear system of inequality Ax lessthanorequalto b has a solution, where A is an m times n matrix of integer coefficients, x is a vector with n components consisting of either 0 or 1, and b is a vector with m integer components. Here Ax lessthanorequalto b means the inequality must be satisfied componentwise