Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.defequiv

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

⇒ logic.propositional.absorpor

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