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