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