Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.falsezeroor

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