Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

¬(T ∧ (F ∨ (q → p))) ↔ (¬¬(r ↔ s) ∨ ¬s)

⇒ logic.propositional.notnot

¬(T ∧ (F ∨ (q → p))) ↔ ((r ↔ s) ∨ ¬s)

⇒ logic.propositional.defequiv

¬(T ∧ (F ∨ (q → p))) ↔ ((r ∧ s) ∨ (¬r ∧ ¬s) ∨ ¬s)