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