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