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