Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.defequiv

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