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