(p ∨∼q) ∧ (∼p ∨∼q)
≡ (∼q ∨ p) ∧ (∼q ∨∼p)
≡∼q ∨ (p ∧∼p)
≡∼q ∨ c
Therefore, (p ∨∼q) ∧ (∼p ∨∼q) ≡∼q
- c being a contradiction
What are the laws being used in each of the four steps?
Commutative, associative, distributive, identity, negation, double negative, idempotent, universal bound, de morgans, absorption or the negations of t and c.
Please help I have no idea were to start.