Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.idempor

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