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