Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroand

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