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