Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.defimpl

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