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