Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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