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