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