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