Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.notnot

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

⇒ logic.propositional.defequiv

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