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