The formulas A → (B ∧ C) and (A → B) ∧ (A → C) are logically equivalent. For this problem, you are going to prove that they are equivalent in two different ways.
Prove that A → (B ∧ C) ≡ (A → B) ∧ (A → C) by writing two semi-formal proofs: one proving A → (B ∧ C) ? (A → B) ∧ (A → C) and another proving (A → B) ∧ (A→C) ? A→(B ∧ C) (using only the eight natural deduction inference rules and no equivalence rules).