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