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