Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.complor

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

⇒ logic.propositional.truezeroand

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