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