Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.defequiv

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