Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.defequiv

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