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