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)) ∨ F)

⇒ logic.propositional.idempand

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

⇒ logic.propositional.truezeroand

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