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