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