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