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