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