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