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