Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.absorpand

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

⇒ logic.propositional.truezeroand

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