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