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