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