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