Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.notnot

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