Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.defequiv

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