Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

(¬(q → p) ↔ ((r ↔ s) ∨ (¬s ∧ ¬s))) ∨ (¬(q → p) ↔ ((r ↔ (F ∨ s)) ∨ (¬s ∧ ¬s)))

⇒ logic.propositional.falsezeroor

(¬(q → p) ↔ ((r ↔ s) ∨ (¬s ∧ ¬s))) ∨ (¬(q → p) ↔ ((r ↔ s) ∨ (¬s ∧ ¬s)))