Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.demorganor

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

⇒ logic.propositional.notnot

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