Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.defimpl

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

⇒ logic.propositional.falsezeroor

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