Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.idempor

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

⇒ logic.propositional.truezeroand

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