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