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