Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.defimpl

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

⇒ logic.propositional.falsezeroor

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