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