Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

(¬¬(F ∨ q) ∧ ¬p) ↔ ((r ↔ s) ∨ ¬s ∨ F)

⇒ logic.propositional.defequiv

(¬¬(F ∨ q) ∧ ¬p) ↔ ((r ∧ s) ∨ (¬r ∧ ¬s) ∨ ¬s ∨ F)

⇒ logic.propositional.absorpor

(¬¬(F ∨ q) ∧ ¬p) ↔ ((r ∧ s) ∨ ¬s ∨ F)

⇒ logic.propositional.falsezeroor

(¬¬(F ∨ q) ∧ ¬p) ↔ ((r ∧ s) ∨ ¬s)