Suppose that is a set of (Boolean) formulas and A and B are two (Boolean) formulas. (a) Show that if |- A B, then |- A and |- B . (b) Is it true that...

Suppose that Γ is a set of (Boolean) formulas and A and B are two (Boolean) formulas.

(a) Show that if Γ |- A ∧ B, then Γ |- A and Γ |- B

.

(b) Is it true that that Γ |- A∨B, then Γ |- A or Γ |- B?

If yes, then give a (meta)proof.

If no, then give a counterexample for appropriately chosen Γ,A,B

.

This is a Boolean logic question for mathematics and computer science if i could get help with this ASAP would be much appreciated