If-then constraints with binary variables in Linear Programming

Question

How can the constraint: if $x_1=1$ then $x_2+x_3\geq 1$ be written in linear programming if the variables $x_1,x_2,x_3$ are binary?

Answer 1

$-x1 + x2 + x3 \geq 0 $

should be sufficient.