Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroor

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