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