Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
Derivation
Final term is not finished
(¬((q ∨ F) → p) ∨ F) ↔ ((((T ∧ r) ∨ r) ↔ s) ∨ ¬s)
⇒ logic.propositional.truezeroand(¬((q ∨ F) → p) ∨ F) ↔ (((r ∨ r) ↔ s) ∨ ¬s)