Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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