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