Suppose that the following statements are true:

(∀x) (A(x) ∧ B(x) ⇒ C(x))

(∃x) (B(x) ∧ ¬C(x))

Show using the laws of first-order logic that the following statement is true:

(∃x)¬A(x)