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