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