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