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