Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroor

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