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