Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
Derivation
Final term is not finished
¬(T ∧ ((q ∧ q) → p)) ↔ (((r ↔ s) ∧ (r ↔ s)) ∨ ¬s)
⇒ logic.propositional.truezeroand¬((q ∧ q) → p) ↔ (((r ↔ s) ∧ (r ↔ s)) ∨ ¬s)
⇒ logic.propositional.idempand¬(q → p) ↔ (((r ↔ s) ∧ (r ↔ s)) ∨ ¬s)
⇒ logic.propositional.defimpl¬(¬q ∨ p) ↔ (((r ↔ s) ∧ (r ↔ s)) ∨ ¬s)