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