Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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