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