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