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