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