I believe a set of operators is functionally complete if every boolean operation (AND, OR, and NOT) can be implemented using them. You already have OR and NOT, so all you need to do is prove that you can implement AND using OR and NOT.

You can use deMorgan's Law: NOT((NOT a) OR (NOT b)) = a AND b