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