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