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