Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
Derivation
Final term is not finished
(¬((q ∧ q) → p) ∨ F) ↔ (((r ↔ s) ∧ T) ∨ ¬s)
⇒ logic.propositional.truezeroand(¬((q ∧ q) → p) ∨ F) ↔ ((r ↔ s) ∨ ¬s)
⇒ logic.propositional.defequiv(¬((q ∧ q) → p) ∨ F) ↔ ((r ∧ s) ∨ (¬r ∧ ¬s) ∨ ¬s)