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