Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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