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