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