Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
Derivation
Final term is not finished
(¬(¬q ∨ p) ∧ ¬(¬q ∨ p)) ↔ ¬¬(T ∧ ((r ↔ s) ∨ ¬s))
⇒ logic.propositional.idempand¬(¬q ∨ p) ↔ ¬¬(T ∧ ((r ↔ s) ∨ ¬s))
⇒ logic.propositional.demorganor(¬¬q ∧ ¬p) ↔ ¬¬(T ∧ ((r ↔ s) ∨ ¬s))
⇒ logic.propositional.notnot(q ∧ ¬p) ↔ ¬¬(T ∧ ((r ↔ s) ∨ ¬s))