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