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