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