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