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