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