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