Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

¬(q → p) ↔ (((F ∨ r) ↔ ((T ∧ s) ∨ (T ∧ s))) ∨ ¬s)

⇒ logic.propositional.idempor

¬(q → p) ↔ (((F ∨ r) ↔ (T ∧ s)) ∨ ¬s)

⇒ logic.propositional.truezeroand

¬(q → p) ↔ (((F ∨ r) ↔ s) ∨ ¬s)