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