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