Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.idempor

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

⇒ logic.propositional.nottrue

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