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