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