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