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