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