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