Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.defimpl

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

⇒ logic.propositional.demorganor

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.notnot

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