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