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