Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

(T ∧ ¬((T ∧ ¬q) ∨ p)) ↔ ((r ↔ (F ∨ s)) ∨ ¬s)

⇒ logic.propositional.truezeroand

(T ∧ ¬(¬q ∨ p)) ↔ ((r ↔ (F ∨ s)) ∨ ¬s)