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