# How to use the distributive law correctly in propositional logic?

Can someone explain how in propositional logic these are equivalent :

A ∧ B ∧ (¬B ∨ ¬C) ≡ A ∧ B ∧ ¬C


Because using the distributive law I would get:

 ≡ (A ∧ B ∧ ¬B) ∨ (A ∧ B ∧ ¬C)
≡  A ∨ (A ∧ B ∧ ¬C)
≡ (A ∨ A) ∧ (A ∨ B) ∧ (A ∨ ¬C)
≡  A ∧ (A ∨ B) ∧ (A ∨ ¬C)


Your first use of the distributive law was correct. Now note that the statement $$A\wedge B\wedge \neg B$$ is a contradiction, and therefore we have $$\begin{array}{rcl}A\wedge B \wedge (\neg B \vee \neg C) &\equiv& (A\wedge B \wedge \neg B) \vee (A \wedge B \wedge \neg C)\\&\equiv &(A\wedge (B \wedge \neg B)) \vee (A \wedge B \wedge \neg C)\\ &\equiv& (A\wedge F)\vee (A \wedge B \wedge \neg C)\\& \equiv&F \vee (A \wedge B \wedge \neg C)\\&\equiv& (A \wedge B \wedge \neg C) \end{array}$$ Where $$F$$ denotes falsem.