Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.defequiv

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