Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.demorganor

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

⇒ logic.propositional.notnot

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